327 search results - page 12 / 66 » Cutting planes in integer and mixed integer programming |
189
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
195
click to vote
MP
2007
15 years 6 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
163
Voted
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...
181
click to vote
AIPS
2007
15 years 9 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 ...
198
click to vote
MP
2006
15 years 6 months ago
2006
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...