The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
From MaRDI portal
Publication:2399487
DOI10.1007/S10898-016-0486-5zbMATH Open1377.90081OpenAlexW2560239528MaRDI QIDQ2399487FDOQ2399487
Authors: Marcel Turkensteen, Panos M. Pardalos, D. S. Malyshev, Boris Goldengorin 
Publication date: 24 August 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0486-5
Recommendations
- Some Basics on Tolerances
- Extending single tolerances to set tolerances
- A note on robustness tolerances for combinatorial optimization problems
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A note on two problems in connexion with graphs
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Introduction to algorithms
- Title not available (Why is that?)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- Branching rules revisited
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Lower tolerance-based branch and bound algorithms for the ATSP
- Tolerance-based branch and bound algorithms for the ATSP
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- An optimal minimum spanning tree algorithm
- On the History of the Minimum Spanning Tree Problem
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- A tolerance-based heuristic approach for the weighted independent set problem
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Efficient computation of tolerances in the weighted independent set problem for trees
- Arc tolerances in shortest path and network flow problems
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs
- Experimental and Efficient Algorithms
- Title not available (Why is that?)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Algorithms and Computation
- New exact method for large asymmetric distance-constrained vehicle routing problem
- On dual solutions of the linear assignment problem
- Sensitivity analysis of the optimal assignment.
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Improving the Hungarian assignment algorithm
- The stable crews problem
- Algorithms for updating minimal spanning trees
- Tolerance-based Algorithms for the Traveling Salesman Problem
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Some Basics on Tolerances
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
Cited In (7)
- Use of the Reduced Tolerance Approach to Rank Efficient Solutions
- Some Basics on Tolerances
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
- Extending single tolerances to set tolerances
- Global tolerances in the problems of combinatorial optimization with an additive objective function
- Tolerance-based Algorithms for the Traveling Salesman Problem
Uses Software
This page was built for publication: The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399487)
