The balanced traveling salesman problem
DOI10.1016/J.COR.2010.09.016zbMATH Open1202.90032OpenAlexW2078701526MaRDI QIDQ614063FDOQ614063
Authors: John LaRusic, Abraham P. Punnen 
Publication date: 23 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.016
Recommendations
- scientific article; zbMATH DE number 795217
- The traveling-salesman problem
- Traveling salesman problem
- Distance-balanced graphs and travelling salesman problems
- On the solution of traveling salesman problems
- The attractive traveling salesman problem
- The selective travelling salesman problem
- scientific article; zbMATH DE number 1947373
Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Efficient algorithms for minimum range cut problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Balanced paths in acyclic networks: Tractable cases and related approaches
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- On the Maximum Scatter Traveling Salesperson Problem
- On Gilmore-Gomory's open question for the bottleneck TSP.
- On finding most uniform spanning trees
- Lexicographic balanced optimization problems
- On generalized balanced optimization problems
- Balanced optimization problems
- The color-balanced spanning tree problem.
- On combined minmax-minsum optimization
- Minimum deviation and balanced optimization: A unified approach
- Minimum cost-reliability ratio path problem
- Most and least uniform spanning trees
- Minimization of maximum absolute deviation in integers
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- The balanced linear programming problem
- A strongly polynomial algorithm for the uniform balanced network flow problem
- Constrained balanced optimization problems
- Some necessary conditions for a graph to be Hamiltonian
- AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- Minimizing the Range of Lateness on a Single Machine
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Minimum Range Balanced Cuts via Dynamic Subset Sums
- Balanced problems on graphs with categorization of edges
- An algorithm to determine a path with minimal cost/capacity ratio
Cited In (13)
- Balanced Optimization with Vector Costs
- Exact algorithms for the equitable traveling salesman problem
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Generalized nash fairness solutions for bi‐objective minimization problems
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Measures of balance in combinatorial optimization
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- 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
- Approximate solutions to the turbine balancing problem.
- The quadratic balanced optimization problem
Uses Software
This page was built for publication: The balanced traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614063)
