Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
type: Item
instance of: scholarly article
title: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
zbMATH Open document ID: 1375.90223
author: Markus Leitner
author: Mario Ruthmair
author: Luis Gouveia
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6816191
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: distance constraint
zbMATH Keywords: integer linear programming
zbMATH Keywords: layered graph
zbMATH Keywords: branch-and-cut
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.04.061
OpenAlex ID: W2611447099
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: Heuristics for the black and white traveling salesman problem
cites work: On implementing the push-relabel method for the maximum flow problem
cites work: The Black and White Traveling Salesman Problem
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: Design of survivable networks with vulnerability constraints
cites work: Hop constrained Steiner trees with multiple root nodes
cites work: The two-level diameter constrained spanning tree problem
cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem
cites work: Load-dependent and precedence-based models for pickup and delivery problems
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: Variable neighborhood search: Principles and applications
cites work: Q5187226
cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
cites work: A new formulation and approach for the black and white traveling salesman problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
cites work: On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
cites work: The four-day aircraft maintenance routing problem
cites work: Q3109941
cites work: An algorithm for designing rings for survivable fiber networks
DOI: 10.1016/J.EJOR.2017.04.061
description: scientific article; zbMATH DE number 6816191