On the public citation graph

A Novel Exact Algorithm for Economic Lot-Sizing with Piecewise Linear Production Costs

https://doi.org/10.2139/ssrn.4856152
0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.21484openalex-extracted
Dynamic lot sizing with all‐units discount and resales
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_48openalex-extracted
To Fill or Not to Fill: The Gas Station Problem
inferredcites →https://doi.org/10.1007/bf01589110openalex-extracted
Facets and algorithms for capacitated lot sizing
inferredcites →https://doi.org/10.1016/j.ejor.2011.01.007openalex-extracted
An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities
inferredcites →https://doi.org/10.1016/j.ejor.2012.04.024openalex-extracted
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
inferredcites →https://doi.org/10.1016/j.ejor.2016.06.040openalex-extracted
Improved exact algorithms to economic lot-sizing with piecewise linear production costs
inferredcites →https://doi.org/10.1016/j.orl.2006.05.003openalex-extracted
A linear-time algorithm for finding optimal vehicle refueling policies
inferredcites →https://doi.org/10.1016/j.orl.2013.09.010openalex-extracted
Economic lot sizing: The capacity reservation model
inferredcites →https://doi.org/10.1080/07408170590918218openalex-extracted
A dynamic lot-sizing model with multi-mode replenishments: polynomial algorithms for special cases with dual and multiple modes
inferredcites →https://doi.org/10.1287/ijoc.2014.0597openalex-extracted
Lot Sizing with Piecewise Concave Production Costs
inferredcites →https://doi.org/10.1287/mnsc.18.1.12openalex-extracted
Deterministic Production Planning with Concave Costs and Capacity Constraints
inferredcites →https://doi.org/10.1287/mnsc.20.3.313openalex-extracted
Bounded Production and Inventory Models with Piecewise Concave Costs
inferredcites →https://doi.org/10.1287/mnsc.21.9.1007openalex-extracted
A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
inferredcites →https://doi.org/10.1287/mnsc.24.16.1710openalex-extracted
An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
inferredcites →https://doi.org/10.1287/mnsc.26.7.669openalex-extracted
Deterministic Production Planning: Algorithms and Complexity
inferredcites →https://doi.org/10.1287/mnsc.35.4.447openalex-extracted
A Dynamic Lot-Size Model with Make-or-Buy Decisions
inferredcites →https://doi.org/10.1287/mnsc.44.6.831openalex-extracted
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
inferredcites →https://doi.org/10.1287/mnsc.5.1.89openalex-extracted
Dynamic Version of the Economic Lot Size Model
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.