A note on solving MINLP's using formulation space search
From MaRDI portal
Recommendations
- Reformulations for utilizing separability when solving convex MINLP problems
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- A minimax approach to the implicit programming problem
- Formal optimization of some reduced linear programming problems
- A primal-dual approximation algorithm for \textsc{minsat}
- On the minimum norm solution of linear programs
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- scientific article; zbMATH DE number 3910145
Cites work
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A heuristic for the circle packing problem with a variety of containers
- A recipe for finding good solutions to MINLPs
- A review of recent advances in global optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Formulation space search approach for the teacher/class timetabling problem
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed integer nonlinear programming tools: a practical overview
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- Mixed-integer nonlinear optimization
- Packing unequal circles using formulation space search
- Reformulation descent applied to circle packing problems
- Variable space search for graph coloring
Cited in
(7)- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A recipe for finding good solutions to MINLPs
- A new model for curriculum-based university course timetabling
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
This page was built for publication: A note on solving MINLP's using formulation space search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448189)
