A novel non-linear approach to minimal area rectangular packing
From MaRDI portal
Publication:610981
DOI10.1007/s10479-008-0462-7zbMath1201.90173OpenAlexW1982965814MaRDI QIDQ610981
Karl-Heinz Küfer, Volker Maag, Martin Berger, 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A simulated annealing approach to the traveling tournament problem
- Multi-dimensional bin packing problems with guillotine constraints
- On NCP-functions
- Bi-level strategies in semi-infinite programming.
- A penalized Fischer-Burmeister NCP-function
- Some new results on simulated annealing applied to the job shop scheduling problem
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- An efficient algorithm for large scale global optimization of continuous functions
- A new constraint programming approach for the orthogonal packing problem
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Denser Packings Obtained in O(n log log n) Time
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- The Tunneling Algorithm for the Global Minimization of Functions
- An Improved Successive Linear Programming Algorithm
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
This page was built for publication: A novel non-linear approach to minimal area rectangular packing
