Kantorovich and Zalgaller (1951): the 0-th column generation algorithm

Eduardo Uchoa & Ruslan Sadykov

Mathematical Programming2026https://doi.org/10.1007/s10107-026-02350-4article
AJG 4
Weight
0.50

What the paper says

This article probes the origins of the Column Generation technique. It begins with Kantorovich’s classic 1939 work, correcting widespread misconceptions about his contributions to the Cutting Stock Problem. It then brings to light Kantorovich and Zalgaller’s lesser-known 1951 book, which is revealed to contain a complete Column Generation algorithm. The article also places these contributions in the context of the turbulent USSR’s political and ideological environment, essential for a deeper understanding of their significance.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1007/s10107-026-02350-4

Or copy a formatted citation

@article{eduardo2026,
  title        = {{Kantorovich and Zalgaller (1951): the 0-th column generation algorithm}},
  author       = {Eduardo Uchoa & Ruslan Sadykov},
  journal      = {Mathematical Programming},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s10107-026-02350-4},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Kantorovich and Zalgaller (1951): the 0-th column generation algorithm

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.