Results 1  10
of
1,730,958
Symmetry in Integer Linear Programming
, 2009
"... An integer linear program (ILP) is symmetric if its variables can be permuted without changing the structure of the problem. Areas where symmetric ILPs arise range from applied settings (scheduling on identical machines), to combinatorics (code construction), and to statistics (statistical designs c ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the structure of the problem. Areas where symmetric ILPs arise range from applied settings (scheduling on identical machines), to combinatorics (code construction), and to statistics (statistical designs
Decomposition in Integer Linear Programming
, 2009
"... Both cutting plane methods and traditional decomposition methods are procedures that compute a bound on the optimal value of an integer linear program (ILP) by constructing an approximation to the convex hull of feasible solutions. This approximation is obtained by intersecting the polyhedron associ ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Both cutting plane methods and traditional decomposition methods are procedures that compute a bound on the optimal value of an integer linear program (ILP) by constructing an approximation to the convex hull of feasible solutions. This approximation is obtained by intersecting the polyhedron
OPTIMA OF DUAL INTEGER LINEAR PROGRAMS
, 1988
"... We consider dual pairs of packing and covering integer linear programs. Best possible bounds are found between their optimal values. Tight inequalities are obtained relating the integral optima and the optimal rational solutions. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We consider dual pairs of packing and covering integer linear programs. Best possible bounds are found between their optimal values. Tight inequalities are obtained relating the integral optima and the optimal rational solutions.
Termination of integer linear programs
 In Proc. CAV’06, LNCS 4144
, 2006
"... Abstract. We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case. This is done by analyzing the powers ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Abstract. We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case. This is done by analyzing the powers
Algorithm), Integer Linear Programming.
"... ACADEMIC PROJECTS • Converting circuits to corresponding CNF formula. (C++) • Constructing Binary decision diagram (BDD) package. (C++) • Developing static implication engine based on the monitor circuit to reduce computation time for SATbased BMC. (C++) • SATbased Inductive Invariant Engine to re ..."
Abstract
 Add to MetaCart
ACADEMIC PROJECTS • Converting circuits to corresponding CNF formula. (C++) • Constructing Binary decision diagram (BDD) package. (C++) • Developing static implication engine based on the monitor circuit to reduce computation time for SATbased BMC. (C++) • SATbased Inductive Invariant Engine to reduce computation time for SATbased BMC. (C++) • Developing Inversion algorithm for breast cancer detection. (MATLAB) • Developing Calling System (consisting on handheld unit and Dot Matrix display) with
Duality for mixedinteger linear programs
 The International Journal of Operations Research
, 2007
"... AbstractThe theory of duality for linear programs is welldeveloped and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixedinteger linear programs, but this has proven difficult, in part because dua ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
AbstractThe theory of duality for linear programs is welldeveloped and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixedinteger linear programs, but this has proven difficult, in part because
Results 1  10
of
1,730,958