A recipe for finding good solutions to MINLPs
From MaRDI portal
Publication:384810
DOI10.1007/s12532-011-0031-yzbMath1276.90041OpenAlexW2130304344MaRDI QIDQ384810
Giacomo Nannicini, Leo Liberti, Nenad Mladenović
Publication date: 28 November 2013
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-011-0031-y
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Three ideas for a feasibility pump for nonconvex MINLP, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Guided dive for the spatial branch-and-bound, A storm of feasibility pumps for nonconvex MINLP, Variable neighborhood search: basics and variants, On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions, A note on solving MINLP's using formulation space search, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Computing feasible points for binary MINLPs with MPECs, A computational study of primal heuristics inside an MI(NL)P solver, New error measures and methods for realizing protein graphs from distance data, Rounding-based heuristics for nonconvex MINLPS, A primal heuristic for optimizing the topology of gas networks based on dual information, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, RENS. The optimal rounding, Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, VNS based algorithm for solving a 0–1 nonlinear nonconvex model for the Collision Avoidance in Air Traffic Management
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point-to-point shortest paths on dynamic time-dependent road networks
- A new polynomial-time algorithm for linear programming
- Global optimization. From theory to implementation.
- General variable neighborhood search for the continuous optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Attraction probabilities in variable neighborhood search
- A feasibility pump for mixed integer nonlinear programs
- Variable neighbourhood search: Methods and applications
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving mixed integer nonlinear programs by outer approximation
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Local branching
- Rounding-based heuristics for nonconvex MINLPS
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- A storm of feasibility pumps for nonconvex MINLP
- Variable neighborhood search and local branching
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The feasibility pump
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Computational Experience with the Molecular Distance Geometry Problem
- The Reformulation-Optimization Software Engine
- Variable neighborhood search: Principles and applications
- Nonlinear programming without a penalty function.
