The Swapping Problem on a Line

  title={The Swapping Problem on a Line},
  author={Shoshana Anily and M. Gendreau and G. Laporte},
  journal={SIAM J. Comput.},
  • Shoshana Anily, M. Gendreau, G. Laporte
  • Published 1999
  • Computer Science, Mathematics
  • SIAM J. Comput.
  • We consider the problem of optimally swapping objects between N workstations, which we refer to as nodes, located on a line. There are m types of objects, and the set of object-types is denoted by S = {1, ..., m}. Object-type 0 is a dummy type, the null object. Each node v contains one unit of a certain object-type $a_v \in S \cup \{0\}$ and requires one unit of object-type $b_v \in S \cup \{0\}$. We assume that the total supply equals the total demand for each of the object-types separately. A… CONTINUE READING

    Topics from this paper.

    Static repositioning in a bike-sharing system: models and solution approaches
    • 335
    • PDF
    Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
    • 122
    The preemptive swapping problem on a tree
    • 22
    • PDF
    Heuristics for the mixed swapping problem
    • 18
    • PDF
    A Branch-and-Cut Algorithm for the Non-Preemptive Swapping Problem
    • 11
    • PDF
    A branch-and-cut algorithm for the preemptive swapping problem
    • 19
    • PDF
    The uncapacitated swapping problem on a line and on a circle
    • 3
    • PDF
    A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
    • 23
    The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
    • 61
    • Highly Influenced
    • PDF


    Publications referenced by this paper.
    The swapping problem
    • 86
    Preemptive Ensemble Motion Planning on a Tree
    • 67
    • PDF
    A Note on the Complexity of a Simple Transportation Problem
    • 29
    • PDF
    Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
    • 93
    • PDF
    Nonpreemptive Ensemble Motion Planning on a Tree
    • 61
    • PDF
    The Design and Analysis of Computer Algorithms
    • 8,944
    • PDF
    Approximation Algorithms for Some Routing Problems
    • 193
    Optimum branchings
    • 1967