L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing

DOI10.1007/s10958-006-0065-2zbMath1081.90054OpenAlexW2053811526MaRDI QIDQ2567707

A. S. Mukhacheva, E. A. Mukhacheva

Publication date: 11 October 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226811

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60)

Related Items (1)

Numerical optimization method for packing regular convex polygons

Cites Work

• Unnamed Item
• Unnamed Item
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• A typology of cutting and packing problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A Linear Programming Approach to the Cutting-Stock Problem
• The cutting stock problem and integer rounding
• Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)

This page was built for publication: L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing