A note on solving MINLP's using formulation space search
From MaRDI portal
Publication:2448189
DOI10.1007/s11590-013-0623-8zbMath1292.90213OpenAlexW2070607375MaRDI QIDQ2448189
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0623-8
Related Items
A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, A new model for curriculum-based university course timetabling, Packing a fixed number of identical circles in a circular container with circular prohibited areas
Uses Software
Cites Work
- Unnamed Item
- A Modeling Language for Mathematical Programming
- A recipe for finding good solutions to MINLPs
- Packing unequal circles using formulation space search
- A heuristic for the circle packing problem with a variety of containers
- 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 programming tools: a practical overview
- A review of recent advances in global optimization
- Variable space search for graph coloring
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Reformulation descent applied to circle packing problems
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Formulation space search approach for the teacher/class timetabling problem
- Mixed-integer nonlinear optimization
