35 search results - page 1 / 7 » Combinatorial Benders' Cuts for Mixed-Integer Linear Program... |
IOR
2006
13 years 4 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...
IOR
2011
12 years 11 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
AIPS
2007
13 years 6 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
ORL
2008
13 years 4 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
CCE
2008
13 years 4 months ago
2008
The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single net...