Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / 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/s12532-012-0039-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078726782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / 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: The Probabilistic Set-Covering Problem / 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 for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for railway crew management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Optimization Perspective on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Large-Scale Aircrew Rostering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based branching schemes for binary linear mixed integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:50, 6 July 2024

scientific article
Language Label Description Also known as
English
Cutting plane versus compact formulations for uncertain (integer) linear programs
scientific article

    Statements

    Cutting plane versus compact formulations for uncertain (integer) linear programs (English)
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization under uncertainty
    0 references
    cutting planes
    0 references
    uncertain set covering
    0 references
    uncertain connectivity problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references