A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem

DOI10.1016/j.dam.2010.05.025zbMath1201.05095MaRDI QIDQ602676

Gilbert Laporte, Güneş Erdoğan, Jean-François Cordeau

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.025

zbMATH Keywords

mathematical programming; branch-and-cut; capacitated; non-preemptive; robot arm travel; swapping problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

Uses Software

• TSPLIB