Pages that link to "Item:Q1029695"
From MaRDI portal
The following pages link to Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695):
Displayed 12 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Optimal Planning of Distributed Generation via Nonlinear Optimization and Genetic Algorithms (Q2974345) (← links)