Column enumeration based decomposition techniques for a class of non-convex MINLP problems
From MaRDI portal
Publication:1029695
DOI10.1007/s10898-007-9271-9zbMath1169.90417MaRDI QIDQ1029695
Panos M. Pardalos, Steffen Rebennack, Josef Kallrath
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9271-9
Related Items
GLOMIQO: global mixed-integer quadratic optimizer, Polylithic modeling and solution approaches using algebraic modeling systems, A review of recent advances in global optimization, Cutting circles and polygons from area-minimizing rectangles, A global optimization point of view to handle non-standard object packing problems, Cutting ellipses from area-minimizing rectangles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization. From theory to implementation.
- Cutting circles and polygons from area-minimizing rectangles
- Packing different-sized circles into a rectangular container
- Packing problems
- Integrated container loading software for pulp and paper industry
- A typology of cutting and packing problems
- A technical review of column generation in integer programming
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Greedy algorithms for packing unequal circles into a rectangular container
