Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667): 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: Solution of a Min-Max Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On min-max \(r\)-gatherings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max vs. Min-Sum vehicle routing: a worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting path method for solving linear bottleneck assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability criteria in vector combinatorial bottleneck problems in terms of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / 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: Extending single tolerances to set tolerances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Hungarian assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dual solutions of the linear assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck flows in unit capacity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance-based branch and bound algorithms for the ATSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addendum on: ``Sensitivity analysis of the optimal assignment'' / rank
 
Normal rank

Revision as of 14:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
scientific article

    Statements

    Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (English)
    0 references
    0 references
    0 references
    24 October 2022
    0 references
    combinatorial optimization
    0 references
    sensitivity analysis
    0 references
    bottleneck objective
    0 references
    linear bottleneck assignment problem
    0 references
    bottleneck spanning tree problem
    0 references
    0 references
    0 references
    0 references

    Identifiers