Sciweavers

489 search results - page 2 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
DISOPT
2008
81views more  DISOPT 2008»
13 years 5 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...
MP
2006
105views more  MP 2006»
13 years 5 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
NETWORKS
2008
13 years 5 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
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
COLOGNETWENTE
2008
13 years 6 months ago
Reformulations in Mathematical Programming: Definitions
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
Leo Liberti