Fast separation algorithms for three-index assignment problems

DOI10.1007/978-3-642-32147-4_18MaRDI QIDQ3167624zbMATH OpenOpenAlexFDO

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

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_18

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Linear-time separation algorithms for the three-index assignment polytope
• Facets of the three-index assignment polytope
• Fast separation for the three-index assignment problem
• scientific article; zbMATH DE number 1894378
• scientific article; zbMATH DE number 776090

Cited in

(4)

• Valid inequalities for a time-indexed formulation
• Linear-time separation algorithms for the three-index assignment polytope
• Facets of the three-index assignment polytope
• Fast separation for the three-index assignment problem

This page was built for publication: Fast separation algorithms for three-index assignment problems

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