Sciweavers

10 search results - page 2 / 2
» Solving a class of stochastic mixed-integer programs with br...
Sort
View
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
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 4 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
WSC
2004
13 years 7 months ago
Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent p...
S. Ilker Birbil, Gül Gürkan, Ovidiu List...
CP
2008
Springer
13 years 7 months ago
Cost-Based Domain Filtering for Stochastic Constraint Programming
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
AIPS
2004
13 years 7 months ago
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
Dmitri A. Dolgov, Edmund H. Durfee