An algorithmic framework for convex mixed integer nonlinear programs
From MaRDI portal
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
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Computational Study of Search Strategies for Mixed Integer Programming
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching rules revisited
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
- Different transformations for solving non-convex trim-loss problems by MINLP
- Experiments in mixed-integer linear programming
- Generalized Benders decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
Cited in
(only showing first 100 items - show all)- An effective branch-and-bound algorithm for convex quadratic integer programming
- Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands
- A Lagrangian decomposition approach for the pump scheduling problem in water networks
- Network expansion to mitigate market power
- 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
- Bound reduction using pairs of linear inequalities
- Mixed integer nonlinear programming tools: an updated practical overview
- Optimal transition maneuvers for a class of V/STOL aircraft
- Genomic feature selection by coverage design optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Inexact solution of NLP subproblems in MINLP
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
- On minimal valid inequalities for mixed integer conic programs
- Operational decisions for multi-period industrial gas pipeline networks under uncertainty
- An algorithm for multiparametric mixed-integer linear programming problems
- Interactive dynamic optimization server -- connecting one modelling language with many solvers
- Adaptive sampling line search for local stochastic optimization with integer variables
- On the implementation of a global optimization method for mixed-variable problems
- A framework for solving mixed-integer semidefinite programs
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Optimal location of green zones in metropolitan areas to control the urban heat island
- Mixed integer nonlinear programming tools: a practical overview
- Towards an objective feasibility pump for convex minlps
- Polyhedral approximation in mixed-integer convex optimization
- QPLIB: a library of quadratic programming instances
- An augmented Lagrangian filter method
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems
- Validation of nominations in gas network optimization: models, methods, and solutions
- Approximation properties and tight bounds for constrained mixed-integer optimal control
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- On support vector machines under a multiple-cost scenario
- A mean-risk mixed integer nonlinear program for transportation network protection
- Constructing lattice-free gradient polyhedra in dimension two
- A note on solving DiDi's driver-order matching problem
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Constructing lattice-free gradient polyhedra in dimension two
- Nonlinear chance-constrained problems with applications to hydro scheduling
- Optimal mitigation and control over power system dynamics for stochastic grid resilience
- 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 partial outer convexification approach to control transmission lines
- Robust tube-based NMPC for dynamic systems with discrete degrees of freedom
- Active set methods with reoptimization for convex quadratic integer programming
- Capacitated disassembly scheduling under stochastic yield and demand
- Lift-and-project cuts for mixed integer convex programs
- Scheduling of network tasks to minimize the consumed energy
- Convex relaxations for mixed-integer nonlinear programs
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A feasibility pump for mixed integer nonlinear programs
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Inversion of convection-diffusion equation with discrete sources
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- Conflict Analysis for MINLP
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
- Sparse classification: a scalable discrete optimization perspective
- On combining machine learning with decision making
- 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
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- The integer approximation error in mixed-integer optimal control
- Reformulations for utilizing separability when solving convex MINLP problems
- Combinatorial optimal control of semilinear elliptic PDEs
- Bounds and convex heuristics for bi-objective optimal experiment design in water networks
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- A global MINLP approach to symbolic regression
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Preprocessing and cutting planes with conflict graphs
- Global solution of non-convex quadratically constrained quadratic programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Template polyhedra and bilinear optimization
- Sparse convex optimization toolkit: a mixed-integer framework
- On handling indicator constraints in mixed integer programming
- Using regularization and second order information in outer approximation for convex MINLP
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
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)
