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

DOI10.1016/J.DAM.2010.05.025zbMath1201.05095OpenAlexW2055044850MaRDI QIDQ602676

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

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 programmingbranch-and-cutcapacitatednon-preemptiverobot arm travelswapping problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ The static bicycle relocation problem with demand intervals ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ On the transformation of lexicographic nonlinear multiobjective programs to single objective programs ⋮ Feasibility recovery for the unit-capacity constrained permutation problem ⋮ The unit-capacity constrained permutation problem ⋮ The multi-commodity pickup-and-delivery traveling salesman problem

Uses Software

• TSPLIB

Cites Work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Heuristics for the mixed swapping problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• An inexact algorithm for the sequential ordering problem
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• A branch-and-cut algorithm for the preemptive swapping problem
• The preemptive swapping problem on a tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• The swapping problem
• Preemptive Ensemble Motion Planning on a Tree
• The Swapping Problem on a Line
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms

This page was built for publication: A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem