Column enumeration based decomposition techniques for a class of non-convex MINLP problems

DOI10.1007/S10898-007-9271-9zbMath1169.90417OpenAlexW2069491280MaRDI QIDQ1029695

Josef Kallrath, Steffen Rebennack, Panos M. Pardalos

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

zbMATH Keywords

decompositionpackingMINLPcolumn enumeration

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items (13)

Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ A review of recent advances in global optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Optimal Planning of Distributed Generation via Nonlinear Optimization and Genetic Algorithms ⋮ Cutting ellipses from area-minimizing rectangles ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ QPLIB: a library of quadratic programming instances ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Cutting circles and polygons from area-minimizing rectangles

Uses Software

• BARON
• LGO
• LINDO
• LINGO
• VerGO

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

This page was built for publication: Column enumeration based decomposition techniques for a class of non-convex MINLP problems