Results 271 to 280 of about 72,730 (310)
Some of the next articles are maybe not open access.
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
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 +2 more sources
Integer programming in forestry
Annals of Operations Research, 2006After finishing my Ph.D. in Berkeley in 1971, I needed a job in the San Francisco Bay Area, while my wife was finishing her Ph.D. in statistics. It was a tough year jobwise and the only available position was a part-time job with the US Forest Service Station in Berkeley, which funded a position as a Research Engineer at the OR Center at UC Berkeley ...
openaire +2 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
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 +1 more source
Communications of the ACM
A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.
openaire +1 more source
A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.
openaire +1 more source
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
Integer and Mixed-Integer Programming
1997We survey techniques for sensitivity analysis of integer programming and related problems. The emphasis is on finding analogues from linear programming.
openaire +1 more source