The balanced traveling salesman problem
From MaRDI portal
Publication:614063
DOI10.1016/j.cor.2010.09.016zbMath1202.90032OpenAlexW2078701526MaRDI QIDQ614063
Abraham P. Punnen, John LaRusic
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
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Measures of balance in combinatorial optimization ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Generalized nash fairness solutions for bi‐objective minimization problems ⋮ Balanced Optimization with Vector Costs ⋮ Robust balanced optimization ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ The quadratic balanced optimization problem
Uses Software
Cites Work
- Unnamed Item
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- On generalized balanced optimization problems
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Balanced optimization problems
- Minimum deviation and balanced optimization: A unified approach
- Most and least uniform spanning trees
- Minimum cost-reliability ratio path problem
- On finding most 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
- On combined minmax-minsum optimization
- A strongly polynomial algorithm for the uniform balanced network flow problem
- On Gilmore-Gomory's open question for the bottleneck TSP.
- Lexicographic balanced optimization problems
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- 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
- On the Maximum Scatter Traveling Salesperson Problem
- Efficient algorithms for minimum range cut problems
- Minimum Range Balanced Cuts via Dynamic Subset Sums
- Balanced problems on graphs with categorization of edges
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Depth-First Search and Linear Graph Algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An algorithm to determine a path with minimal cost/capacity ratio
This page was built for publication: The balanced traveling salesman problem
