A new formulation and approach for the black and white traveling salesman problem

DOI10.1016/j.cor.2014.07.019zbMath1348.90550OpenAlexW1978514218MaRDI QIDQ337265

Ịbrahim Muter

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.019

zbMATH Keywords

column generationtraveling salesman problemcutting planesbranch-and-price

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Theory and application of reciprocal transformation of “path problem” and “time float problem”

Cites Work

• Heuristics for the black and white traveling salesman problem
• The traveling salesman problem and its variations.
• The Four-Day Aircraft Maintenance Routing Problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• An algorithm for designing rings for survivable fiber networks
• The Black and White Traveling Salesman Problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Column Generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Implementing Mixed Integer Column Generation

This page was built for publication: A new formulation and approach for the black and white traveling salesman problem