A branch-and-cut algorithm for the preemptive swapping problem

DOI10.1002/NET.20447MaRDI QIDQ2913951zbMATHOpenAlexFDO

Authors Charles Bordenave, Michel Gendreau, G. Laporte

Publication date 21 September 2012

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20447

zbMATH Keywords

branch-and-cutvehicle routingswapping problemprecedence relationships

Mathematics Subject Classification ID

Applications of graph theory (05C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• A branch-and-cut algorithm for the nonpreemptive swapping problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• The preemptive swapping problem on a tree
• Heuristics for the mixed swapping problem
• The swapping problem

Cites work

• scientific article; zbMATH DE number 742961 (Why is no real title available?)
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• A new approach to the maximum-flow problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An inexact algorithm for the sequential ordering problem
• Edmonds polytopes and weakly hamiltonian graphs
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Heuristics for the mixed swapping problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the symmetric travelling salesman problem I: Inequalities
• The Swapping Problem on a Line
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The precedence-constrained asymmetric traveling salesman polytope
• The preemptive swapping problem on a tree
• The swapping problem

Cited in

(11)

• The swapping problem
• Heuristics for the mixed swapping problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
• Bike sharing systems: solving the static rebalancing problem
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• The preemptive swapping problem on a tree
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• The static bicycle relocation problem with demand intervals
• The unit-capacity constrained permutation problem

Describes a project that uses

Uses Software

• Concorde
• CVRPSEP
• CVRPSP

This page was built for publication: A branch-and-cut algorithm for the preemptive swapping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913951)