An algorithmic framework for convex mixed integer nonlinear programs
From MaRDI portal
Publication:951092
DOI10.1016/J.DISOPT.2006.10.011zbMATH Open1151.90028OpenAlexW2170213261MaRDI QIDQ951092FDOQ951092
Authors: Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, Andreas Wächter, Gérard Cornuéjols, François Margot, Nicolas Sawaya 
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.011
Recommendations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- scientific article; zbMATH DE number 1264409
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Cites Work
- Benchmarking optimization software with performance profiles.
- A Computational Study of Search Strategies for Mixed Integer Programming
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Solving mixed integer nonlinear programs by outer approximation
- Branching rules revisited
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Different transformations for solving non-convex trim-loss problems by MINLP
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Experiments in mixed-integer linear programming
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
Cited In (only showing first 100 items - show all)
- Operational decisions for multi-period industrial gas pipeline networks under uncertainty
- Mixed integer nonlinear programming tools: a practical overview
- Polyhedral approximation in mixed-integer convex optimization
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- A mean-risk mixed integer nonlinear program for transportation network protection
- Convex relaxations for mixed-integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Capacitated disassembly scheduling under stochastic yield and demand
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Inversion of convection-diffusion equation with discrete sources
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Reformulations for utilizing separability when solving convex MINLP problems
- Combinatorial optimal control of semilinear elliptic PDEs
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Template polyhedra and bilinear optimization
- On handling indicator constraints in mixed integer programming
- A disjunctive cut strengthening technique for convex MINLP
- Graphical models for optimal power flow
- Mixed-integer convex representability
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Extended formulations in mixed-integer convex programming
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Disjunctive cuts in mixed-integer conic optimization
- Embedded optimal control of robot manipulators with passive joints
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Global solution of bilevel programming problems
- A risk-averse stochastic program for integrated system design and preventive maintenance planning
- On the Weber facility location problem with limited distances and side constraints
- Three ideas for a feasibility pump for nonconvex MINLP
- Product allocation to different types of distribution center in retail logistics networks
- Virtuous smoothing for global optimization
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Subgradient based outer approximation for mixed integer second order cone programming
- When is rounding allowed in integer nonlinear optimization?
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- An order-based algorithm for minimum dominating set with application in graph mining
- A method for convex black-box integer global optimization
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- Outer approximation with conic certificates for mixed-integer convex problems
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Regularized optimization methods for convex MINLP problems
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Genomic feature selection by coverage design optimization
- Maximizing the storage capacity of gas networks: a global MINLP approach
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
- Network expansion to mitigate market power
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Optimal transition maneuvers for a class of V/STOL aircraft
- On minimal valid inequalities for mixed integer conic programs
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
- An algorithm for multiparametric mixed-integer linear programming problems
- On the implementation of a global optimization method for mixed-variable problems
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Optimal location of green zones in metropolitan areas to control the urban heat island
- QPLIB: a library of quadratic programming instances
- Towards an objective feasibility pump for convex minlps
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Using the analytic center in the feasibility pump
- Validation of nominations in gas network optimization: models, methods, and solutions
- Heuristics for convex mixed integer nonlinear programs
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Energy-optimal multi-goal motion planning for planar robot manipulators
- A feasibility pump for mixed integer nonlinear programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- On combining machine learning with decision making
- Sparse classification: a scalable discrete optimization perspective
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- The integer approximation error in mixed-integer optimal control
- A global MINLP approach to symbolic regression
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- The travelling salesman problem with neighbourhoods: MINLP solution
- The supporting hyperplane optimization toolkit for convex MINLP
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Mathematical programming techniques in water network optimization
- Extending the QCR method to general mixed-integer programs
- On the optimal design of water distribution networks: a practical MINLP approach
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- An Algorithm Model for Mixed Variable Programming
- A recipe for finding good solutions to MINLPs
- A framework for globally optimizing mixed-integer signomial programs
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Conic mixed-integer rounding cuts
- A 3D optimal control problem related to the urban heat islands
- GLOMIQO: global mixed-integer quadratic optimizer
Uses Software
This page was built for publication: An algorithmic framework for convex mixed integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951092)
