Stability aspects of the traveling salesman problem based on \(k\)-best solutions

DOI10.1016/S0166-218X(98)00055-9zbMath0910.90264OpenAlexW1975605925MaRDI QIDQ1270780

Marek Libura, Edo S. van der Poort, Gerard Sierksma, Jack A. A. van der Veen

Publication date: 19 April 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

stability analysistraveling salesmantolerance regions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (22)

On one type of stability for multiobjective integer linear programming problem with parameterized optimality ⋮ Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations ⋮ Postoptimal analysis of the multicriteria combinatorial median location problem ⋮ Stability and accuracy functions in multicriteria linear combinatorial optimization problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Analysis of a High-Performance TSP Solver on the GPU ⋮ Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ Quantitative stability analysis for vector problems of 0-1 programming ⋮ Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem ⋮ The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges ⋮ An exact method for the double TSP with multiple stacks ⋮ Tolerance-based branch and bound algorithms for the ATSP ⋮ Reoptimization of the metric deadline TSP ⋮ A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem ⋮ Reoptimization of the Metric Deadline TSP ⋮ Unnamed Item ⋮ On the Hardness of Reoptimization ⋮ Approximation hardness of deadline-TSP reoptimization ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Investment Boolean problem with savage risk criteria under uncertainty

Uses Software

• TSPLIB

Cites Work

• Approaches to sensitivity analysis in linear programming
• 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
• Solving the \(k\)-best traveling salesman problem
• Calculation of stability radii for combinatorial optimization problems
• Advances in sensitivity analysis and parametric programming
• Some concepts of stability analysis in combinatorial optimization
• Parametric methods in integer linear programming
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
• The Tolerance Approach to Sensitivity Analysis in Linear Programming
• TSPLIB—A Traveling Salesman Problem Library
• Some Easy Postoptimality Analysis for Zero-One Programming
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Optimal schedules with infinitely large stability radius^∗
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability aspects of the traveling salesman problem based on \(k\)-best solutions