Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Calculation of stability radii for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in sensitivity analysis and parametric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric methods in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal schedules with infinitely large stability radius<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Easy Postoptimality Analysis for Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some concepts of stability analysis in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the \(k\)-best traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preview of a tolerance approach to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tolerance Approach to Sensitivity Analysis in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789337 / rank
 
Normal rank

Revision as of 16:18, 28 May 2024

scientific article
Language Label Description Also known as
English
Stability aspects of the traveling salesman problem based on \(k\)-best solutions
scientific article

    Statements

    Stability aspects of the traveling salesman problem based on \(k\)-best solutions (English)
    0 references
    0 references
    0 references
    0 references
    19 April 1999
    0 references
    stability analysis
    0 references
    traveling salesman
    0 references
    tolerance regions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers