An algorithm for binary linear chance-constrained problems using IIS (Q2419523): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128641235, #quickstatements; #temporary_batch_1723583190453
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-018-00055-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2907751462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective stochastic programming for portfolio selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mixing set with a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Set Covering with Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility and infeasibility in optimization. Algorithms and computational methods. / 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: Identifying Minimally Infeasible Subsystems of Inequalities / 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: Mathematical programming approaches for generating \(p\)-efficient points / 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: A Sample Approximation Approach for Optimization with Probabilistic Constraints / 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: 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: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Binary Packing Problems / 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 / Wikidata QID
 
Property / Wikidata QID: Q128641235 / rank
 
Normal rank

Latest revision as of 22:12, 13 August 2024

scientific article
Language Label Description Also known as
English
An algorithm for binary linear chance-constrained problems using IIS
scientific article

    Statements

    An algorithm for binary linear chance-constrained problems using IIS (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    chance-constrained programming
    0 references
    infeasible irreducible subsystems
    0 references
    integer programming
    0 references

    Identifiers