Robust combinatorial optimization with variable budgeted uncertainty (Q1942010): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1007/s10288-012-0217-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152324313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered Formulation for the Robust Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / 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: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded convex sets for non-convex mixed-integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguous chance constrained problems and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic binary problems with simple penalties for capacity constraints violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:08, 6 July 2024

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

    Statements

    Robust combinatorial optimization with variable budgeted uncertainty (English)
    0 references
    0 references
    0 references
    25 March 2013
    0 references
    0 references
    robust optimization
    0 references
    multifunction
    0 references
    combinatorial optimization
    0 references
    variable uncertainty
    0 references
    chance constraint
    0 references
    0 references