Bidimensional packing by bilinear programming
- 30 August 2007
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 118 (1) , 75-108
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Global optimization problems and domain reduction strategiesMathematical Programming, 2009
- Improved approximation algorithms for multidimensional bin packing problems2006
- Bidimensional Packing by Bilinear ProgrammingLecture Notes in Computer Science, 2005
- Packing 2-dimensional bins in harmony2003
- Concavity cuts for disjoint bilinear programmingMathematical Programming, 2001
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization ProblemsSIAM Journal on Optimization, 2000
- A symmetrical linear maxmin approach to disjoint bilinear programmingMathematical Programming, 1999
- Generalized bilinear programming: Part I. Models, applications and linear programming relaxationEuropean Journal of Operational Research, 1992
- A pseudopolynomial network flow formulation for exact knapsack separationNetworks, 1992
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987