Chance-Constrained Binary Packing Problems (Q2940063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2014.0595 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Independent Lifting for Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The submodular knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for solving integer problems under probabilistic constraints with random technology matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capital rationing problems under uncertainty and risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertain convex programs: randomized solutions and confidence levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scenario Approach to Robust Control Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local cuts for mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization methods for optimization problems with probabilistic constraints / 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: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixing sets arising in chance-constrained programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for linear programs with probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5201292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Approximations of Chance Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample average approximation method for chance constrained programming: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Linear Programming with Violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra / 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: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2014.0595 / rank
 
Normal rank

Latest revision as of 05:28, 20 December 2024

scientific article
Language Label Description Also known as
English
Chance-Constrained Binary Packing Problems
scientific article

    Statements

    Chance-Constrained Binary Packing Problems (English)
    0 references
    0 references
    0 references
    0 references
    26 January 2015
    0 references
    chance-constrained stochastic programming
    0 references
    integer programming
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references