A branch-and-cut algorithm for the balanced traveling salesman problem

DOI10.1007/s10878-023-01097-4OpenAlexW4377223525WikidataQ129042105 ScholiaQ129042105MaRDI QIDQ6123381

Viet Hung Nguyen, Mourad Baïou, Thi Quynh Trang Vo

Publication date: 4 March 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01097-4

zbMATH Keywords

traveling salesman problembranch-and-cutmixed-integer programmingbalanced optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10) Experimental work for problems pertaining to operations research and mathematical programming (90-05)

Cites Work

• Unnamed Item
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• The balanced traveling salesman problem
• Balanced optimization problems
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• A strongly polynomial algorithm for the uniform balanced network flow problem
• On Gilmore-Gomory's open question for the bottleneck TSP.
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• Multi-Terminal Network Flows
• TSPLIB—A Traveling Salesman Problem Library
• On the Maximum Scatter Traveling Salesperson Problem
• Efficient algorithms for minimum range cut problems
• Balanced paths in acyclic networks: Tractable cases and related approaches
• Computer Solutions of the Traveling Salesman Problem
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A branch-and-cut algorithm for the balanced traveling salesman problem