Journal ArticleDOI
Mathematical Methods of Organizing and Planning Production
Reads0
Chats0
TLDR
This work presents an original method, going beyond the limits of classical mathematical analysis, for solving extremal problems and provides an application of mathematical methods to questions of organizing production which merits the serious attention of workers in different branches of industry.Abstract:
The author of the work “Mathematical Methods of Organizing and Planning Production”, Professor L. V. Kantorovich, is an eminent authority in the field of mathematics. This work is interesting from a purely mathematical point of view since it presents an original method, going beyond the limits of classical mathematical analysis, for solving extremal problems. On the other hand, this work also provides an application of mathematical methods to questions of organizing production which merits the serious attention of workers in different branches of industry.
This is the English translation of the famous 1939 article by L. V. Kantorovich, originally published in Russian.read more
Citations
More filters
Journal ArticleDOI
A typology of cutting and packing problems
TL;DR: The paper develops a consistent and systematic approach for a comprehensive typology integrating the various kinds of problems, founded on the basic logical structure of cutting and packing problems.
Journal ArticleDOI
Selected Topics in Column Generation
TL;DR: The growing understanding of the dual point of view is emphasized, which has brought considerable progress to the column generation theory and practice, and is an ever recurring concept in "selected topics."
Journal ArticleDOI
Multistage Cutting Stock Problems of Two and More Dimensions
P. C. Gilmore,Ralph E. Gomory +1 more
TL;DR: In this paper, higher dimensional cutting stock problems are discussed as linear programming problems, and a solution described for the sequencing problem under given simplifying assumptions is given for the auxiliary sequencing problem.
Journal ArticleDOI
Bin packing can be solved within 1 + ε in linear time
TL;DR: In this paper, it was shown that for any positive e, there exists an O(n)-time algorithmS such that, if S(L) denotes the number of bins used by S for L, thenS(L)/L*≦1+e for anyL provided L* is sufficiently large.
Book
Linear and Nonlinear Optimization
TL;DR: This chapter discusses the foundations of optimization, and some of the methods for unconstrained optimization, as well as topics from linear algebra, including the simplex method and other fundamentals.