Sciweavers

IPCO
2004
100views Optimization» more  IPCO 2004»
13 years 6 months ago
Valid Inequalities Based on Simple Mixed-Integer Sets
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
Sanjeeb Dash, Oktay Günlük
IPCO
2004
107views Optimization» more  IPCO 2004»
13 years 6 months ago
A Robust Optimization Approach to Supply Chain Management
Abstract. We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time...
Dimitris Bertsimas, Aurélie Thiele
IPCO
2004
95views Optimization» more  IPCO 2004»
13 years 6 months ago
Combinatorial Benders' Cuts
Gianni Codato, Matteo Fischetti
IPCO
2004
110views Optimization» more  IPCO 2004»
13 years 6 months ago
Scheduling an Industrial Production Facility
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 6 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 6 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
IPCO
2007
81views Optimization» more  IPCO 2007»
13 years 6 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...