Exact algorithms for the equitable traveling salesman problem

DOI10.1016/j.ejor.2017.02.017zbMath1403.90575OpenAlexW2375089373MaRDI QIDQ1753595

Frits C. R. Spieksma, Joris Kinable, Eline Delcour, Bart Smeulders

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/538102

zbMATH Keywords

combinatorial optimizationbranch-and-boundtraveling salesman problembranch-and-priceexact algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

Balanced Optimization with Vector Costs ⋮ Robust balanced optimization ⋮ A note on equitable Hamiltonian cycles ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem

Uses Software

• TSPLIB
• LEMON
• JGraphT

Cites Work

• Unnamed Item
• Unnamed Item
• Natural and extended formulations for the time-dependent traveling salesman problem
• The balanced traveling salesman problem
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
• Balanced optimization problems
• Most and least uniform spanning trees
• Minimization of maximum absolute deviation in integers
• A classification of formulations for the (time-dependent) traveling salesman problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Mixed Integer Linear Programming Formulation Techniques
• (1,2)-HAMILTONIAN COMPLETION ON A MATCHING
• Efficient algorithms for minimum range cut problems
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
• Balanced paths in acyclic networks: Tractable cases and related approaches
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Solution of a Large-Scale Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Exact algorithms for the equitable traveling salesman problem