Fast Separation Algorithms for Three-Index Assignment Problems

DOI10.1007/978-3-642-32147-4_18zbMath1370.90293OpenAlexW75447996MaRDI QIDQ3167624

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

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

Related Items (1)

Valid inequalities for a time-indexed formulation

This page was built for publication: Fast Separation Algorithms for Three-Index Assignment Problems