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

DOI10.1016/0166-218X(93)90164-JzbMath0781.90069MaRDI QIDQ1801663

Egon Balas, Liqun Qi

Publication date: 17 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cliquesodd holesfacet inducing inequalitiesthree-index assignment polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (11)

A survey for the quadratic assignment problem ⋮ Fast separation for the three-index assignment problem ⋮ Facets of the axial three-index assignment polytope ⋮ Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Selected topics on assignment problems ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ On multi-index assignment polytopes ⋮ Linear-time separation algorithms for the three-index assignment polytope ⋮ Randomized parallel algorithms for the multidimensional assignment problem ⋮ Clique facets of the axial and planar assignment polytopes

Cites Work

• Linear-time separation algorithms for the three-index assignment polytope
• Complexity of a 3-dimensional assignment problem
• Facets of the three-index assignment polytope
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• Letter to the Editor—The Multidimensional Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear-time separation algorithms for the three-index assignment polytope