An outer-approximation algorithm for a class of mixed-integer nonlinear programs
From MaRDI portal
(Redirected from 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)- Genomic feature selection by coverage design optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Inexact solution of NLP subproblems in MINLP
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- Interactive dynamic optimization server -- connecting one modelling language with many solvers
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- 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
- Optimal design of multi-echelon supply chain networks under normally distributed demand
- Optimal location of green zones in metropolitan areas to control the urban heat island
- Mixed integer nonlinear programming tools: a practical overview
- Analysis of order-of-addition experiments
- Mathematical programming approaches for generating p-efficient points
- Interactions between nonlinear programming and modeling systems
- An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming
- A branch and bound algorithm for bi-level discrete network design problem
- Integrating multiple sources of ordinal information in portfolio optimization
- Polyhedral approximation in mixed-integer convex optimization
- QPLIB: a library of quadratic programming instances
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Using projected cutting planes in the extended cutting plane method
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Optimal exact design of double acceptance sampling plans by attributes
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Profitability of online order fulfillment in multi-channel retailing
- Sparse regression: scalable algorithms and empirical performance
- On cutting plane algorithms for nonlinear binary optimization
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Linearization of mixed-integer products
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- 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
- Optimization methods for mixed integer weakly concave programming problems
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Global optimization of disjunctive programs
- Constructing lattice-free gradient polyhedra in dimension two
- Cutting plane algorithm for convex generalized disjunctive programs
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Alternate solution approaches for competitive hub location problems
- Generalized Benders' decomposition for topology optimization problems
- A hybrid approach to resolving a differentiable integer program.
- Solving Euclidean max-sum problems exactly with cutting planes
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Constructing lattice-free gradient polyhedra in dimension two
- Nonlinear chance-constrained problems with applications to hydro scheduling
- An algorithmic framework for convex mixed integer nonlinear programs
- A partial outer convexification approach to control transmission lines
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- A flexible platform for mixed-integer non-linear programming problems
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- Capacitated disassembly scheduling under stochastic yield and demand
- A planar single facility location and border crossing problem
- A unified approach to mixed-integer optimization problems with logical constraints
- A feasibility pump for mixed integer nonlinear programs
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Cardinality minimization, constraints, and regularization: a survey
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Inversion of convection-diffusion equation with discrete sources
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Conflict Analysis for MINLP
- scientific article; zbMATH DE number 1322737 (Why is no real title available?)
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
- Sparse classification: a scalable discrete optimization perspective
- 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
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- Outer approximation for integer nonlinear programs via decision diagrams
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Concurrent processing of mixed-integer non-linear programming problems
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Supply capacity acquisition and allocation with uncertain customer demands
- Logistic regression: from art to science
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Modeling design and control problems involving neural network surrogates
- Solving mixed integer nonlinear programs by outer approximation
- An algorithm for nonlinear optimization problems with binary variables
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Reformulations for utilizing separability when solving convex MINLP problems
- Combinatorial optimal control of semilinear elliptic PDEs
- High-Performance Prototyping of Decomposition Methods in GAMS
- Challenges in optimal control problems for gas and fluid flow in networks of pipes and canals: from modeling to industrial applications
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A new local and global optimization method for mixed integer quadratic programming problems
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
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)
