The Swapping Problem on a Line

DOI10.1137/S0097539797323108zbMath0938.90012OpenAlexW2003198915MaRDI QIDQ4268883

Shoshana Anily, Gilbert Laporte, Michel Gendreau

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797323108

zbMATH Keywords

transshipment problemswapping problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ A branch-and-cut algorithm for the preemptive swapping problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ Pallet location and job scheduling in a twin-robot system ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ A branch‐and‐cut algorithm for the nonpreemptive swapping problem ⋮ Preemptive stacker crane problem: extending tree-based properties and construction heuristics ⋮ Heuristics for the mixed swapping problem ⋮ The preemptive swapping problem on a tree ⋮ A truck scheduling problem arising in intermodal container transportation

This page was built for publication: The Swapping Problem on a Line