A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2008.04.043 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: LOTSIZELIB / 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.1016/j.ejor.2008.04.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009562333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / 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: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs / 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: Distribution Strategies that Minimize Transportation and Inventory Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the single item capacitated dynamic lot size model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5314962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-facility management of production and transportation planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / 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: Analysis of a flow problem with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: Progress with single-item lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manufacturing Planning Over Alternative Facilities: Modeling, Analysis and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2008.04.043 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:45, 10 December 2024

scientific article
Language Label Description Also known as
English
A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
scientific article

    Statements

    A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (English)
    0 references
    8 April 2009
    0 references
    inventory
    0 references
    economic lot-sizing
    0 references
    primal-dual algorithm
    0 references
    multi-setups costs
    0 references
    network flows
    0 references
    0 references
    0 references

    Identifiers