Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement

DOI10.1007/BF02733434zbMath0952.52015MaRDI QIDQ1974322

I. E. Lazareva, M. V. Novozhilova

Publication date: 3 January 2001

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxation; rectangle cutting

Mathematics Subject Classification ID

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)

05B40: Combinatorial aspects of packing and covering

Cites Work

• Packing problems
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Multistage Cutting Stock Problems of Two and More Dimensions
• Unnamed Item