Clique facets of the axial and planar assignment polytopes

Authors:
D. Magos;I. Mourtos
Affiliations:
Department of Informatics, Athens University of Economics and Business, 76 Patission Ave., 104 34 Athens, Greece;Department of Management Science and Technology, Athens University of Economics and Business, 76 Patission Ave., 104 34 Athens, Greece
Venue:
Discrete Optimization
Year:
2009

Citing 10
Cited 0

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
On latin squares and the facial structure of related polytopes

Discrete Mathematics
Facets of the three-index assignment polytope

Discrete Applied Mathematics
Polyhedral combinatorics

Optimization
An algorithm for the three-index assignment problem

Operations Research
Linear-time separation algorithms for the three-index assignment polytope

Discrete Applied Mathematics
Three-dimensional axial assignment problems with decomposable cost coefficients

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Time-tables, polyhedra and the greedy algorithm

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Selected topics on assignment problems

Discrete Applied Mathematics
A new class of facets for the Latin square polytope

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The (k,s)assignment problem sets a unified framework for studying the facial structure of families of assignment polytopes. Through this framework, we derive classes of clique facets for all axial and planar assignment polytopes. For each of these classes, a polynomial-time separation procedure is described. Furthermore, we provide computational experience illustrating the efficiency of these facet-defining inequalities when applied as cutting planes.