Robust combinatorial optimization with knapsack uncertainty (Q1662111): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2017.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2620153647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization with variable budgeted uncertainty / 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: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over Integers with Robustness in Cost and Few Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Reliable Stochastic Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained shortest path with uncertain transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean Decomposition for Mean-Variance Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity assignment solutions for telecommunications networks with uncertain demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Network Design with Uncertain Outsourcing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust maximum flow with polyhedral uncertainty sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity analysis for robust single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Least-Cost Nonblocking Broadband Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning virtual private networks under traffic uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization under Decision-Dependent Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization with variable cost uncertainty / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:14, 16 July 2024

scientific article
Language Label Description Also known as
English
Robust combinatorial optimization with knapsack uncertainty
scientific article

    Statements

    Robust combinatorial optimization with knapsack uncertainty (English)
    0 references
    0 references
    17 August 2018
    0 references
    robust optimization
    0 references
    combinatorial optimization
    0 references
    approximation algorithms
    0 references
    ellipsoidal uncertainty
    0 references
    0 references
    0 references

    Identifiers