Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (Q507343): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Multi-Item Lot-Sizing Problems with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Lot-sizing with fixed charges on stocks: the convex hull'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic lot‐sizing model with production time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Production and Inventory Models with Piecewise Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four equivalent lot-sizing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing with fixed charges on stocks: the convex hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing with production and delivery time windows / rank
 
Normal rank

Latest revision as of 09:52, 13 July 2024

scientific article
Language Label Description Also known as
English
Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
scientific article

    Statements

    Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (English)
    0 references
    3 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lot-sizing
    0 references
    stock upper bounds
    0 references
    stock fixed costs
    0 references
    mixed integer programming
    0 references
    convex hull
    0 references
    0 references
    0 references