On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q516836
Created claim: Wikidata QID (P12): Q127829822, #quickstatements; #temporary_batch_1722635374576
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stan P. M. van Hoesel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs / 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: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(96)00043-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107647148 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127829822 / rank
 
Normal rank

Latest revision as of 22:50, 2 August 2024

scientific article
Language Label Description Also known as
English
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
scientific article

    Statements

    On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (English)
    0 references
    0 references
    0 references
    15 January 1998
    0 references
    polyhedral combinatorics
    0 references
    single-item discrete lot-sizing
    0 references
    convex hull of feasible solutions
    0 references
    Wagner-Whitin costs
    0 references

    Identifiers