Open AccessBook
Annotated Bibliographies in Combinatorial Optimization
TLDR
Part I: General methodologies complexity and approximability polyhedral combinatorics branch-and-cut algorithms matroids and submodular functions advances in linear programming decomposition and column generation stochastic integer programming randomized algorithms local search graphs and matrices.Abstract:
Part I: General methodologies complexity and approximability polyhedral combinatorics branch-and-cut algorithms matroids and submodular functions advances in linear programming decomposition and column generation stochastic integer programming randomized algorithms local search graphs and matrices. Part II: Specific topics and applications sequencing and scheduling "Travelling Salesman Problem" max cut location problems network design flows and paths quadratic and 3-dimensional assignments linear assignment vehicle routing cutting and packing combinatorial topics in VLSI design applications in computational biology.read more
Citations
More filters
Journal ArticleDOI
Resource-constrained project scheduling: Notation, classification, models, and methods
TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.
Journal ArticleDOI
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
Journal ArticleDOI
A review of scheduling research involving setup considerations
TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Journal ArticleDOI
Two-dimensional packing problems: A survey
TL;DR: This work considers problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste by discussing mathematical models, lower bounds, classical approximation algorithms, recent heuristic and metaheuristic methods and exact enumerative approaches.
Journal ArticleDOI
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Edoardo Amaldi,Viggo Kann +1 more
TL;DR: Strong bounds on the approximability of various variants of Min RVLS and min ULR are determined, including constrained ones where the variables are restricted to take binary values or where some relations are mandatory while others are optional.