Sciweavers

184 search results - page 3 / 37
» Integer Polyhedra for Program Analysis
Sort
View
DISOPT
2008
81views more  DISOPT 2008»
13 years 7 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
SAS
1999
Springer
13 years 12 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
IPCO
2010
174views Optimization» more  IPCO 2010»
13 years 9 months ago
On Lifting Integer Variables in Minimal Inequalities
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
Amitabh Basu, Manoel B. Campêlo, Michele Con...
EOR
2000
74views more  EOR 2000»
13 years 7 months ago
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
Andrew J. Miller, George L. Nemhauser, Martin W. P...
MP
2007
100views more  MP 2007»
13 years 7 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni