MIP reformulations of the probabilistic set covering problem (Q847820): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167201389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling via Integer Programs with Circular Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method for stochastic integer problems under probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavity and efficient points of discrete distributions in probabilistic programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Symmetries and Invariance Principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations for probabilistically constrained programs with discrete random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532224 / rank
 
Normal rank

Latest revision as of 12:04, 2 July 2024

scientific article
Language Label Description Also known as
English
MIP reformulations of the probabilistic set covering problem
scientific article

    Statements

    MIP reformulations of the probabilistic set covering problem (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Probabilistic programming
    0 references
    Set covering
    0 references
    Cutting planes
    0 references
    0 references
    0 references
    0 references
    0 references