On the recoverable robust traveling salesman problem (Q331985): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Subgraph Recoverable Robust Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Timetable Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on upper bounds to the robust knapsack problem with discrete scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition approach for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method / rank
 
Normal rank

Latest revision as of 19:28, 12 July 2024

scientific article
Language Label Description Also known as
English
On the recoverable robust traveling salesman problem
scientific article

    Statements

    On the recoverable robust traveling salesman problem (English)
    0 references
    0 references
    0 references
    27 October 2016
    0 references
    robust optimization
    0 references
    traveling salesman problem
    0 references
    recoverable robustness
    0 references

    Identifiers