Results 241 to 250 of about 998,636 (282)
Some of the next articles are maybe not open access.
Optimization Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Smoothed analysis of integer programming
Mathematical Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heiko Röglin, Berthold Vöcking
openaire +3 more sources
Branch and bound, integer, and non-integer programming
Annals of Operations Research, 2006In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today that is the use of branch and bound to handle discrete constructs, which, while often formally representable in terms of zero-one integer variables, can be handled more elegantly ...
John J. H. Forrest, John A. Tomlin
openaire +1 more source
The atoms of integer programming
Annals of Operations Research, 2007After thirty years of doing other things, I am once again doing some research on integerprogramming. It has been interesting and exciting for me to see what has changed duringthose thirty years.The practical side of integer programming has developed far more than I would haveever anticipated.
openaire +1 more source
Logical Processing for Integer Programming
Annals of Operations Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monique Guignard 0001 +2 more
openaire +3 more sources
Constraint Integer Programming
2007Diese Arbeit stellt einen integrierten Ansatz aus "Constraint Programming" (CP) und Gemischt-Ganzzahliger Programmierung ("Mixed Integer Programming", MIP) vor, den wir "Constraint Integer Programming" (CIP) nennen. Sowohl Modellierungs- als auch Lösungstechniken beider Felder fließen in den neuen integrierten Ansatz ein, um die unterschiedlichen ...
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 1991
For each value of the parameters $A,n,d$, a linear program exists whose integer solutions correspond to codes. The Plotkin bound gives a necessary and sufficient condition on $n/d$ for feasibility. Some further simple remarks on the tableau of the linear program can be made; it can also be modified to consider only linear codes.
openaire +1 more source
For each value of the parameters $A,n,d$, a linear program exists whose integer solutions correspond to codes. The Plotkin bound gives a necessary and sufficient condition on $n/d$ for feasibility. Some further simple remarks on the tableau of the linear program can be made; it can also be modified to consider only linear codes.
openaire +1 more source
Elementary closures for integer programs
Operations Research Letters, 2001In integer programming, the elementary closure associated with a family of cuts is the convex set defined by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two ...
Gérard Cornuéjols, Yanjun Li
openaire +2 more sources
On the complexity of integer programming
Journal of the ACM, 1981A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints.
openaire +2 more sources
A Method of Decomposition for Integer Programs
Operations Research, 1979A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is
Dennis J. Sweeney, Richard A. Murphy
openaire +1 more source