Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Strong formulations of robust mixed 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Uncertainty Sets for Robust Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-driven 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: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and uncertainty sets for data-driven robust shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414632 / 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: Robust optimization approach for a chance-constrained binary knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting and separation of robust cover inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach to the chance-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4605945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the robust knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:03, 1 August 2024

scientific article; zbMATH DE number 7711820
Language Label Description Also known as
English
Comparative analysis of linear programming relaxations for the robust knapsack problem
scientific article; zbMATH DE number 7711820

    Statements

    Comparative analysis of linear programming relaxations for the robust knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2023
    0 references
    robust knapsack problem
    0 references
    integer optimization models
    0 references
    strong formulations
    0 references
    linear programming relaxations
    0 references
    comparative analysis
    0 references

    Identifiers