The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
From MaRDI portal
Publication:2399487
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
Cites work
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- A note on two problems in connexion with graphs
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A tolerance-based heuristic approach for the weighted independent set problem
- Algorithms and Computation
- Algorithms for updating minimal spanning trees
- An addendum on: ``Sensitivity analysis of the optimal assignment
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An optimal minimum spanning tree algorithm
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Arc tolerances in shortest path and network flow problems
- Branching rules revisited
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs
- Efficient computation of tolerances in the weighted independent set problem for trees
- Experimental and Efficient Algorithms
- Graph-Theoretic Concepts in Computer Science
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- Improving the Hungarian assignment algorithm
- Introduction to algorithms
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Lower tolerance-based branch and bound algorithms for the ATSP
- New exact method for large asymmetric distance-constrained vehicle routing problem
- On dual solutions of the linear assignment problem
- On the History of the Minimum Spanning Tree Problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Sensitivity analysis of the optimal assignment.
- Some Basics on Tolerances
- TSPLIB—A Traveling Salesman Problem Library
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The stable crews problem
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Tolerance-based Algorithms for the Traveling Salesman Problem
- Tolerance-based branch and bound algorithms for the ATSP
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Cited in
(9)- On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
- Assessing the effect of multiple cost changes using reverse set tolerances
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Global tolerances in the problems of combinatorial optimization with an additive objective function
- Use of the Reduced Tolerance Approach to Rank Efficient Solutions
- Tolerance-based Algorithms for the Traveling Salesman Problem
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- Extending single tolerances to set tolerances
- Some Basics on Tolerances
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)
