CCO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
CPM
2009
Springer
13 years 9 months ago
2009
Springer
CPM
2010
Springer
13 years 9 months ago
2010
Springer
CPM
2010
Springer
13 years 9 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
CPM
2010
Springer
13 years 9 months ago
2010
Springer
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...
COCOON
2010
Springer
13 years 9 months ago
2010
Springer