Fast separation for the three-index assignment problem

DOI10.1007/S12532-016-0106-XMaRDI QIDQ2398106zbMATH OpenOpenAlexFDO

Authors Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma

Publication date 15 August 2017

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/79458/1/MPC_R2.pdf

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Linear-time separation algorithms for the three-index assignment polytope
• Fast separation algorithms for three-index assignment problems
• An Algorithm for the Three-Index Assignment Problem
• scientific article; zbMATH DE number 776090
• Facets of the axial three-index assignment polytope

Cites work

• A branch and cut solver for the maximum stable set problem
• A branch-and-cut algorithm for the pallet loading problem
• A polyhedral approach to sequence alignment problems
• A polyhedral approach to single-machine scheduling problems.
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• An Algorithm for the Three-Index Assignment Problem
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Clique facets of the axial and planar assignment polytopes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Facets of the three-index assignment polytope
• scientific article; zbMATH DE number 1894374 (Why is no real title available?)
• scientific article; zbMATH DE number 1894378 (Why is no real title available?)
• Linear-time separation algorithms for the three-index assignment polytope
• On multi-index assignment polytopes
• Parametrized GRASP heuristics for three-index assignment
• Separating lifted odd-hole inequalities to solve the index selection problem
• Separation algorithms for 0-1 knapsack polytopes
• Separation problems for the stable set polytope
• Test problem generator for the multidimensional assignment problem
• The traveling salesman problem. A computational study.
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Wheel inequalities for stable set polytopes

Cited in

(2)

• Fast separation algorithms for three-index assignment problems
• scientific article; zbMATH DE number 776090 (Why is no real title available?)

Describes a project that uses

Uses Software

• CPLEX
• Concorde

This page was built for publication: Fast separation for the three-index assignment problem

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