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

DOI10.1016/0166-218X(93)90164-JzbMATH Open0781.90069MaRDI QIDQ1801663FDOQ1801663

Authors: E. Balas, Liqun Qi 

Publication date: 17 August 1993

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

Recommendations

• scientific article; zbMATH DE number 776090
• Facets of the axial three-index assignment polytope
• Fast separation algorithms for three-index assignment problems
• scientific article; zbMATH DE number 1894378
• scientific article; zbMATH DE number 166078

zbMATH Keywords

cliquesodd holesfacet inducing inequalitiesthree-index assignment polytope

Mathematics Subject Classification ID

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

Cites Work

• Facets of the three-index assignment polytope
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• Title not available (Why is that?)
• Letter to the Editor—The Multidimensional Assignment Problem
• Complexity of a 3-dimensional assignment problem
• An Algorithm for the Three-Index Assignment Problem
• Title not available (Why is that?)
• Linear-time separation algorithms for the three-index assignment polytope
• Title not available (Why is that?)

Cited In (16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801663)