Capacitated lot sizing problems with inventory bounds (Q492789): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6474548 / rank
 
Normal rank
Property / zbMATH Keywords
 
lot sizing problem
Property / zbMATH Keywords: lot sizing problem / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-item
Property / zbMATH Keywords: multi-item / rank
 
Normal rank
Property / zbMATH Keywords
 
single-item
Property / zbMATH Keywords: single-item / rank
 
Normal rank
Property / zbMATH Keywords
 
inventory bounds
Property / zbMATH Keywords: inventory bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
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.1007/s10479-015-1816-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008685592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-item uncapacitated lot sizing problem with inventory bounds / rank
 
Normal rank
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: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of relaxations for the multi-item capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic lot-sizing problem with inventory-bounds and constant order-capacities / 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: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities / 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: A note on ``The economic lot sizing problem with inventory bounds'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size / 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
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-sizing with production and delivery time windows / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:47, 10 July 2024

scientific article
Language Label Description Also known as
English
Capacitated lot sizing problems with inventory bounds
scientific article

    Statements

    Capacitated lot sizing problems with inventory bounds (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    lot sizing problem
    0 references
    multi-item
    0 references
    single-item
    0 references
    inventory bounds
    0 references
    dynamic programming
    0 references
    complexity
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references