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

DOI10.1016/J.COR.2014.07.019zbMATH Open1348.90550OpenAlexW1978514218MaRDI QIDQ337265FDOQ337265

Ị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

cutting planestraveling salesman problemcolumn generationbranch-and-price

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• A New Formulation for the Travelling Salesman Problem
• 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
• Heuristics for the black and white traveling salesman problem

   Recommendations

• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem 👍 👎
• Approximation Algorithms for the Black and White Traveling Salesman Problem 👍 👎
• A New Formulation for the Travelling Salesman Problem 👍 👎
• Heuristics for the black and white traveling salesman problem 👍 👎
• The Black and White Traveling Salesman Problem 👍 👎
• A new approach to solve the traveling salesman problem 👍 👎
• A new generalization of the traveling salesman problem 👍 👎

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

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