489 search results - page 2 / 98 » Formulations and Reformulations in Integer Programming |
87
Voted
DISOPT
2008
14 years 11 months ago
2008
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 ...
MP
2006
14 years 11 months ago
2006
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...
NETWORKS
2008
14 years 11 months ago
2008
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...
IOR
2006
14 years 11 months ago
2006
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...
107
click to vote
COLOGNETWENTE
2008
15 years 1 months ago
2008
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...