A novel non-linear approach to minimal area rectangular packing
From MaRDI portal
(Redirected from Publication:610981)
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
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 2005717 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- A new constraint programming approach for the orthogonal packing problem
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A penalized Fischer-Burmeister NCP-function
- A simulated annealing approach to the traveling tournament problem
- An Improved Successive Linear Programming Algorithm
- An efficient algorithm for large scale global optimization of continuous functions
- Bi-level strategies in semi-infinite programming.
- Denser packings obtained in \(O(n \log \log n)\) time
- Handbook of constraint programming.
- Multi-dimensional bin packing problems with guillotine constraints
- New approximability and inapproximability results for 2-dimensional bin packing
- On NCP-functions
- Optimization by simulated annealing
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Some new results on simulated annealing applied to the job shop scheduling problem
- The Tunneling Algorithm for the Global Minimization of Functions
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
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Exact and approximation algorithms for a soft rectangle packing problem
- An efficient deterministic optimization approach for rectangular packing problems
- 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)
