Bidimensional Packing by Bilinear Programming

DOI10.1007/11496915_28zbMath1119.90357OpenAlexW2129526548MaRDI QIDQ3596354

Alberto Caprara, Michele Monaci, Marco Locatelli

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_28

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items

Prospective Network Flow Models and Algorithms for Bin Packing Problems, A new exact method for the two-dimensional orthogonal packing problem, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, A new constraint programming approach for the orthogonal packing problem, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A new lower bound for the non-oriented two-dimensional bin-packing problem, Unnamed Item, A branch-and-cut algorithm for mixed-integer bilinear programming, Convexification of bilinear forms through non-symmetric lifting, Bidimensional packing by bilinear programming