Sciweavers

28 search results - page 1 / 6
» Conflict analysis in mixed integer programming
Sort
View
DISOPT
2007
84views more  DISOPT 2007»
13 years 5 months ago
Conflict analysis in mixed integer programming
Tobias Achterberg
ENDM
2010
81views more  ENDM 2010»
13 years 5 months ago
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications
We call "on/off" constraint an algebraic constraint that is activated if and only if
Hassan Hijazi, Pierre Bonami, Gérard Cornu&...
ANOR
2005
94views more  ANOR 2005»
13 years 5 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
IOR
2006
177views more  IOR 2006»
13 years 5 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
ASPDAC
2008
ACM
86views Hardware» more  ASPDAC 2008»
13 years 7 months ago
An MILP-based wire spreading algorithm for PSM-aware layout modification
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying ...
Ming-Chao Tsai, Yung-Chia Lin, Ting-Chi Wang