Exact algorithms for the equitable traveling salesman problem
DOI10.1016/J.EJOR.2017.02.017zbMATH Open1403.90575OpenAlexW2375089373MaRDI QIDQ1753595FDOQ1753595
Authors: J. Kinable, Bart Smeulders, Eline Delcour, Frits C. R. Spieksma 
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
Recommendations
- The balanced traveling salesman problem
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- The traveling salesman problem on a graph and some related integer polyhedra
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- The Black and White Traveling Salesman Problem
combinatorial optimizationexact algorithmstraveling salesman problembranch-and-boundbranch-and-price
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A classification of formulations for the (time-dependent) traveling salesman problem
- Solution of a Large-Scale Traveling-Salesman Problem
- A method for solving traveling-salesman problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Efficient algorithms for minimum range cut problems
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- Natural and extended formulations for the time-dependent traveling salesman problem
- Balanced optimization problems
- The color-balanced spanning tree problem.
- Mixed integer linear programming formulation techniques
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Most and least uniform spanning trees
- Minimization of maximum absolute deviation in integers
- The balanced traveling salesman problem
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
- (1,2)-Hamiltonian completion on a matching
Cited In (7)
- A note on equitable Hamiltonian cycles
- Balanced Optimization with Vector Costs
- The equity constrained shortest path problem
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective
- Robust balanced optimization
- A branch-and-cut algorithm for the balanced traveling salesman problem
Uses Software
This page was built for publication: Exact algorithms for the equitable traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753595)
