A branch-and-cut algorithm for the preemptive swapping problem
DOI10.1002/NET.20447zbMATH Open1247.90072OpenAlexW2134465458MaRDI QIDQ2913951FDOQ2913951
Charles Bordenave, G. Laporte, Michel Gendreau
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
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)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- An inexact algorithm for the sequential ordering problem
- Integer Programming Formulation of Traveling Salesman Problems
- On the symmetric travelling salesman problem I: Inequalities
- A new approach to the maximum-flow problem
- Multistars, partial multistars and the capacitated vehicle routing problem
- The swapping problem
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Heuristics for the mixed swapping problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- The precedence-constrained asymmetric traveling salesman polytope
- Edmonds polytopes and weakly hamiltonian graphs
- The preemptive swapping problem on a tree
- Title not available (Why is that?)
- The Swapping Problem on a Line
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
Cited In (9)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
- The swapping problem
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem
- The unit-capacity constrained permutation problem
- The static bicycle relocation problem with demand intervals
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- Heuristics for the mixed swapping problem
- Bike sharing systems: solving the static rebalancing problem
Uses Software
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)
