Bulk-robust combinatorial optimization (Q2515045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987283756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Design with Exponential Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(s\)-\(t\) connection problem with adaptability / rank
 
Normal rank
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: Budgeted matching and budgeted matroid intersection via the gasoline puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction approaches for robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Combinatorial Optimization with Exponential Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches to multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many birds with one stone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on the collection of edges in MSTs of induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Path, Matrix, and Triangle Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:07, 9 July 2024

scientific article
Language Label Description Also known as
English
Bulk-robust combinatorial optimization
scientific article

    Statements

    Bulk-robust combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2015
    0 references
    robust optimization
    0 references
    combinatorial optimization
    0 references
    matroid
    0 references
    shortest path
    0 references
    fault tolerant
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references