Robust flows with adaptive mitigation (Q6114899): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejco.2020.100002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3126941613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recoverable Robust Two-Level Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing residual flow under an arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / 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: Robust and Adaptive Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-commodity robust network design with finite and hose demand sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum residual flow problem: <i>NP</i>‐hardness with two‐arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backward Sampling Framework for Interdiction Problems with Fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three‐stage procurement optimization problem under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable network design under optimal and heuristic interdiction scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of adjustable robust optimization / 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
Property / cites work
 
Property / cites work: Adjustable Robust Optimization via Fourier–Motzkin Elimination / rank
 
Normal rank

Latest revision as of 16:43, 1 August 2024

scientific article; zbMATH DE number 7711223
Language Label Description Also known as
English
Robust flows with adaptive mitigation
scientific article; zbMATH DE number 7711223

    Statements

    Robust flows with adaptive mitigation (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2023
    0 references
    adjustable robust optimization
    0 references
    supply chain
    0 references
    cut-generation
    0 references
    network flows
    0 references
    0 references

    Identifiers

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