scientific article
From MaRDI portal
Publication:3879251
zbMath0438.05024MaRDI QIDQ3879251
Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)
Related Items
A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants, Packing congruent hyperspheres into a hypersphere, Packing unequal circles into a strip of minimal length with a jump algorithm, Packing equal circles into a circle with circular prohibited areas, Packing different cuboids with rotations and spheres into a cuboid, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles
