Extremal values of global tolerances in combinatorial optimization with an additive objective function
From MaRDI portal
Publication:453633
DOI10.1007/s10898-012-9847-xzbMath1275.90078OpenAlexW2164948952MaRDI QIDQ453633
Boris I. Goldengorin, Panos M. Pardalos, Vyacheslav V. Chistyakov
Publication date: 27 September 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9847-x
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on robustness tolerances for combinatorial optimization problems
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Complexity of uniqueness and local search in quadratic 0-1 programming
- On the complexity of postoptimality analysis of \(0/1\) programs
- Solving the \(k\)-best traveling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Lower tolerance-based branch and bound algorithms for the ATSP
- Tolerance-based branch and bound algorithms for the ATSP
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- A note on Arc tolerances in sparse shortest-path and network flow problems
- Arc tolerances in shortest path and network flow problems
- An Algorithm for the Three-Index Assignment Problem
- An Algorithm for the Traveling Salesman Problem
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Extremal values of global tolerances in combinatorial optimization with an additive objective function
