18 search results - page 1 / 4 » Strong Formulations of Robust Mixed 0-1 Programming |
MP
2006
13 years 4 months ago
2006
We introduce strong formulations for robust mixed 0
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
MP
2006
13 years 4 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
JGO
2008
13 years 4 months ago
2008
We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under...
ENDM
2010
13 years 4 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...