A branch-and-cut algorithm for the preemptive swapping problem
type: Item
instance of: scholarly article
title: A branch-and-cut algorithm for the preemptive swapping problem
zbMATH Open document ID: 1247.90072
author: Charles Bordenave
author: Michel Gendreau
author: G. Laporte
published in: Networks
publication date: 2012-09-21T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6085247
zbMATH Keywords: swapping problem
zbMATH Keywords: vehicle routing
zbMATH Keywords: branch-and-cut
zbMATH Keywords: precedence relationships
describes a project that uses: CVRPSP
describes a project that uses: Concorde
describes a project that uses: CVRPSEP
MaRDI profile type: Publication
full work available at URL: net.20447
OpenAlex ID: W2134465458
cites work: The swapping problem
cites work: The Swapping Problem on a Line
cites work: The preemptive swapping problem on a tree
cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: A branch‐and‐cut algorithm for the nonpreemptive swapping problem
cites work: Heuristics for the mixed swapping problem
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: An inexact algorithm for the sequential ordering problem
cites work: A new approach to the maximum-flow problem
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: Q4763403
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
cites work: Multistars, partial multistars and the capacitated vehicle routing problem
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
DOI: 10.1002/NET.20447
description: scientific article; zbMATH DE number 6085247