Fast separation for the three-index assignment problem
From MaRDI portal
Publication:2398106
DOI10.1007/s12532-016-0106-xzbMath1368.90106OpenAlexW2389595001MaRDI QIDQ2398106
Ioannis Mourtos, Trivikram Dokka, 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- A branch and cut solver for the maximum stable set problem
- Clique facets of the axial and planar assignment polytopes
- Separating lifted odd-hole inequalities to solve the index selection problem
- Wheel inequalities for stable set polytopes
- A polyhedral approach to sequence alignment problems
- A polyhedral approach to single-machine scheduling problems.
- Parametrized GRASP heuristics for three-index assignment
- Test problem generator for the multidimensional assignment problem
- A branch-and-cut algorithm for the pallet loading problem
- Linear-time separation algorithms for the three-index assignment polytope
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Facets of the three-index assignment polytope
- On multi-index assignment polytopes
- Separation algorithms for 0-1 knapsack polytopes
- An Algorithm for the Three-Index Assignment Problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Separation problems for the stable set polytope
This page was built for publication: Fast separation for the three-index assignment problem
