A branch and bound method for stochastic integer problems under probabilistic constraints (Q4709729): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/1055678021000033937 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092425721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated lot-sizing: The convex hull of solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Search: Optimum Distribution of Search Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance Constrained Programming with Joint Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic programming in production planning: a case with none-simple recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of stochastic programming / 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: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank

Latest revision as of 16:52, 5 June 2024

scientific article; zbMATH DE number 1932806
Language Label Description Also known as
English
A branch and bound method for stochastic integer problems under probabilistic constraints
scientific article; zbMATH DE number 1932806

    Statements

    A branch and bound method for stochastic integer problems under probabilistic constraints (English)
    0 references
    0 references
    0 references
    2002
    0 references
    Stochastic Integer Programming, Probabilistic Programming, Branch And Bound
    0 references
    0 references
    0 references

    Identifiers