A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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.cor.2011.10.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046354711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of literature on determining the lot size under quantity discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic lot size model with quantity discount / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An economic production lot size model with increasing demand, shortages and partial backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the dynamic economic lot size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for procurement problems under a total quantity discount structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimal algorithm for the quantity discount problem in material requirement planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic quantity discount lot size model with resales / 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: The dynamic lot size model with quantity discount: Counterexamples and correction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:09, 5 July 2024

scientific article
Language Label Description Also known as
English
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
scientific article

    Statements

    A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic quantity discount
    0 references
    all-units discount
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references
    lot sizing with resale
    0 references
    time complexity function
    0 references
    0 references