A novel non-linear approach to minimal area rectangular packing
From MaRDI portal
Publication:610981
DOI10.1007/S10479-008-0462-7zbMATH Open1201.90173OpenAlexW1982965814MaRDI QIDQ610981FDOQ610981
Authors: Volker Maag, Martin Berger, Karl-Heinz Küfer, Anton Winterfeld 
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1981
Recommendations
- A new nonlinear model for the two-dimensional rectangle packing problem
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Optimal rectangle packing
- An efficient deterministic optimization approach for rectangular packing problems
- A simulated annealing algorithm for solving the two-dimensional rectangular packing problem in bins with tabu areas
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of constraint programming.
- Bi-level strategies in semi-infinite programming.
- On NCP-functions
- Title not available (Why is that?)
- The Tunneling Algorithm for the Global Minimization of Functions
- A simulated annealing approach to the traveling tournament problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A penalized Fischer-Burmeister NCP-function
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Some new results on simulated annealing applied to the job shop scheduling problem
- Multi-dimensional bin packing problems with guillotine constraints
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A new constraint programming approach for the orthogonal packing problem
- An Improved Successive Linear Programming Algorithm
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- New approximability and inapproximability results for 2-dimensional bin packing
- An efficient algorithm for large scale global optimization of continuous functions
- Denser packings obtained in \(O(n \log \log n)\) time
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
Cited In (10)
- Optimal rectangle packing: an absolute placement approach
- A simulated annealing algorithm for solving the two-dimensional rectangular packing problem in bins with tabu areas
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- A new nonlinear model for the two-dimensional rectangle packing problem
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- Exact and approximation algorithms for a soft rectangle packing problem
- An efficient deterministic optimization approach for rectangular packing problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Local search algorithms for the rectangle packing problem with general spatial costs
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
This page was built for publication: A novel non-linear approach to minimal area rectangular packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610981)
