Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/orl/AgraC99, #quickstatements; #temporary_batch_1731508824982
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs / 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: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(99)00030-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088645769 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/orl/AgraC99 / rank
 
Normal rank

Latest revision as of 15:58, 13 November 2024

scientific article
Language Label Description Also known as
English
Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
scientific article

    Statements

    Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (English)
    0 references
    5 December 2001
    0 references
    Lotsizing problem
    0 references
    Wagner-Whitin cost
    0 references
    extended formulation
    0 references
    polyhedral combinatoric
    0 references
    mixed integer programming
    0 references

    Identifiers