Stability aspects of the traveling salesman problem based on k-best solutions
From MaRDI portal
Publication:1270780
Recommendations
Cites work
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- A preview of a tolerance approach to sensitivity analysis in linear programming
- Advances in sensitivity analysis and parametric programming
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Approaches to sensitivity analysis in linear programming
- Calculation of stability radii for combinatorial optimization problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 4053347 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3499494 (Why is no real title available?)
- scientific article; zbMATH DE number 1301840 (Why is no real title available?)
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Optimal schedules with infinitely large stability radius∗
- Parametric methods in integer linear programming
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Solving the k-best traveling salesman problem
- Some concepts of stability analysis in combinatorial optimization
- Some Easy Postoptimality Analysis for Zero-One Programming
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- TSPLIB—A Traveling Salesman Problem Library
- Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
Cited in
(25)- Approximation hardness of deadline-TSP reoptimization
- Solving the k-best traveling salesman problem
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Balancing of simple assembly lines under variations of task processing times
- Quantitative stability analysis for vector problems of 0-1 programming
- The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
- Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study
- Reoptimization of the metric deadline TSP
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems
- Tolerance-based branch and bound algorithms for the ATSP
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
- An exact method for the double TSP with multiple stacks
- Postoptimal analysis of the multicriteria combinatorial median location problem
- Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
- Reoptimization of the Metric Deadline TSP
- Analysis of a high-performance TSP solver on the GPU
- scientific article; zbMATH DE number 6965181 (Why is no real title available?)
- Strong stability for multiobjective investment problem with perturbed minimax risks of different types and parameterized optimality
- On radius of one stability type for a multicriteria investment problem with risk minimization
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- On the Hardness of Reoptimization
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Analyzing Stability of Extreme Portfolios
- Investment Boolean problem with savage risk criteria under uncertainty
- On one type of stability for multiobjective integer linear programming problem with parameterized optimality
This page was built for publication: Stability aspects of the traveling salesman problem based on \(k\)-best solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1270780)
