327 search results - page 18 / 66 » Cutting planes in integer and mixed integer programming |
106
click to vote
ENDM
2010
14 years 10 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
115
click to vote
SIAMJO
2010
14 years 11 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
104
click to vote
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
PLDI
2000
ACM
15 years 5 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
123
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...