An outer-approximation algorithm for a class of mixed-integer nonlinear programs
From MaRDI portal
Publication:3757690
Recommendations
- Solving mixed integer nonlinear programs by outer approximation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
Cites work
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A central cutting plane algorithm for the convex programming problem
- A duality theorem and an algorithm for (mixed-) integer nonlinear programming
- A procedure for new product positioning in an attribute space
- An Approach to the Optimal Positioning of a New Product
- An outer approximations algorithm for computer-aided design problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Canonical Cuts on the Unit Hypercube
- Convex Analysis
- Cutting-Plane Methods without Nested Constraint Sets
- Disjunctive Programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Generalized Benders decomposition
- Identification of special structure constraints in linear programs
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- Optimal short-term scheduling of large-scale power systems
- Partitioning procedures for solving mixed-variables programming problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
- Some polyhedra related to combinatorial problems
- Surrogate Constraints
- The Cutting-Plane Method for Solving Convex Programs
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning
Cited in
(only showing first 100 items - show all)- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Optimal location of green zones in metropolitan areas to control the urban heat island
- Different transformations for solving non-convex trim-loss problems by MINLP
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Perspective reformulation and applications
- GLOMIQO: global mixed-integer quadratic optimizer
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution
- A hybrid LP/NLP paradigm for global optimization relaxations
- An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Solving mixed integer nonlinear programs by outer approximation
- Optimization of a complex flexible multibody systems with composite materials
- Natural gas production network infrastructure development under uncertainty
- Stochastic single-allocation hub location
- Extended formulations in mixed integer conic quadratic programming
- Heuristics for convex mixed integer nonlinear programs
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A branch-and-reduce approach to global optimization
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- A recipe for finding good solutions to MINLPs
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Solving planning and design problems in the process industry using mixed integer and global optimization
- A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- A new local and global optimization method for mixed integer quadratic programming problems
- A global MINLP approach to symbolic regression
- Decomposition strategy for the stochastic pooling problem
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Mixed integer nonlinear programming tools: an updated practical overview
- scientific article; zbMATH DE number 1322737 (Why is no real title available?)
- An algorithm for nonlinear optimization problems with binary variables
- Linearization of mixed-integer products
- The supporting hyperplane optimization toolkit for convex MINLP
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- The oracle penalty method
- Route optimization for multiple searchers
- A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
- An algorithmic framework for convex mixed integer nonlinear programs
- Optimal exact design of double acceptance sampling plans by attributes
- A flexible platform for mixed-integer non-linear programming problems
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- An LPCC approach to nonconvex quadratic programs
- Optimization methods for mixed integer weakly concave programming problems
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Supply capacity acquisition and allocation with uncertain customer demands
- Mixed integer programming with a class of nonlinear convex constraints
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A planar single facility location and border crossing problem
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Finding multiple solutions to general integer linear programs
- Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Generalized Benders' decomposition for topology optimization problems
- The stochastic trim-loss problem
- Inexact solution of NLP subproblems in MINLP
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A 3D optimal control problem related to the urban heat islands
- QPLIB: a library of quadratic programming instances
- A branch and bound algorithm for bi-level discrete network design problem
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- A storm of feasibility pumps for nonconvex MINLP
- Sparse regression over clusters: SparClur
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A feasibility pump for mixed integer nonlinear programs
- Sparse classification: a scalable discrete optimization perspective
- A review of deterministic optimization methods in engineering and management
- Optimal design of multi-echelon supply chain networks under normally distributed demand
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- A multiperiod approach to the solution of groundwater management problems using an outer approximation method
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Challenges in optimal control problems for gas and fluid flow in networks of pipes and canals: from modeling to industrial applications
- Rehabilitation and replacement of water distribution system components considering uncertainties
- Capacitated disassembly scheduling under stochastic yield and demand
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Subgradient based outer approximation for mixed integer second order cone programming
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- An optimization method for solving mixed discrete-continuous programming problems
- Three ideas for a feasibility pump for nonconvex MINLP
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Sparse regression: scalable algorithms and empirical performance
- A four-type decision-variable MINLP model for a supply chain network design
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Outer approximation for integer nonlinear programs via decision diagrams
- Sparse hierarchical regression with polynomials
This page was built for publication: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757690)
