On the public citation graph

Kiln Planning, A Cutting Stock Approach

https://doi.org/10.2139/ssrn.1120998

0 signed · 12 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.1007/978-3-642-51693-1openalex-extracted

Multi-Stage Production Planning and Inventory Control

inferredcites →https://doi.org/10.1007/978-3-642-58165-6openalex-extracted

Cutting and Packing in Production and Distribution

inferredcites →https://doi.org/10.1016/0377-2217(90)90349-gopenalex-extracted

Average-case analysis of cutting and packing in two dimensions

inferredcites →https://doi.org/10.1016/0377-2217(90)90350-kopenalex-extracted

A typology of cutting and packing problems

inferredcites →https://doi.org/10.1057/jors.1974.5openalex-extracted

The Cutting Stock Problem in the Flat Glass Industry

inferredcites →https://doi.org/10.1057/jors.1976.187openalex-extracted

The Cutting Stock Problem in the Flat Glass Industry -- Selection of Stock Sizes

inferredcites →https://doi.org/10.1111/j.1475-3995.2000.tb00194.xopenalex-extracted

Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

inferredcites →https://doi.org/10.1137/0209062openalex-extracted

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

inferredcites →https://doi.org/10.1287/opre.13.1.94openalex-extracted

Multistage Cutting Stock Problems of Two and More Dimensions

inferredcites →https://doi.org/10.1287/opre.25.1.30openalex-extracted

An Algorithm for Two-Dimensional Cutting Problems

inferredcites →https://doi.org/10.1287/opre.27.2.290openalex-extracted

A Production Scheduling Problem in the Glass-Container Industry

inferredcites →https://doi.org/10.1287/opre.9.6.849openalex-extracted

A Linear Programming Approach to the Cutting-Stock Problem

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.