Algorithms and Software for Convex Mixed Integer Nonlinear Programs
From MaRDI portal
Publication:2897292
DOI10.1007/978-1-4614-1927-3_1zbMath1242.90121OpenAlexW1918578756MaRDI QIDQ2897292
Mustafa R. Kılınç, Jeff Linderoth, Pierre Bonami
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/60690
Related Items (55)
Cutting-planes for weakly-coupled 0/1 second order cone programs ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Learning Optimized Risk Scores ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ On handling indicator constraints in mixed integer programming ⋮ Using projected cutting planes in the extended cutting plane method ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ Cutting Plane Algorithm for Convex Generalized Disjunctive Programs ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ Strong relaxations for continuous nonlinear programs based on decision diagrams ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ Multi-view metro station clustering based on passenger flows: a functional data-edged network community detection approach ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ Daily scheduling of generating units with natural-gas market constraints ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ A note on solving MINLP's using formulation space search ⋮ Least costly energy management for extended-range electric vehicles: an economic optimization framework ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Modeling max-min fair bandwidth allocation in BitTorrent communities ⋮ Logistic regression: from art to science ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ A note on solving DiDi's driver-order matching problem ⋮ Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ Integrality gap minimization heuristics for binary mixed integer nonlinear programming ⋮ On speed scaling via integer programming ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Valid inequalities for separable concave constraints with indicator variables ⋮ Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints ⋮ Partially distributed outer approximation ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches ⋮ Approximated perspective relaxations: a project and lift approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Orbital branching
- Improved strategies for branching on general disjunctions
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Lift-and-project for mixed 0-1 programming: recent progress
- Conic mixed-integer rounding cuts
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- On the solution of traveling salesman problems
- Partitioning procedures for solving mixed-variables programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- MINTO, a Mixed INTeger Optimizer
- Solving mixed integer nonlinear programs by outer approximation
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- Exploiting orbits in symmetric ILP
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Computational study of a family of mixed-integer quadratic programming problems
- 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
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- Edmonds polytopes and a hierarchy of combinatorial problems
- The feasibility pump
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Outline of an algorithm for integer solutions to linear programs
- The Cutting-Plane Method for Solving Convex Programs
- An Automatic Method of Solving Discrete Programming Problems
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Some NP-complete problems in quadratic and nonlinear programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Large-Scale Network Topological Optimization
- Branch and Bound Methods for Mathematical Programming Systems
- Disjunctive Programming
- CONOPT—A Large-Scale GRG Code
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
- A Computational Study of Search Strategies for Mixed Integer Programming
- LOQO:an interior point code for quadratic programming
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A tree-search algorithm for mixed integer programming problems
- Experiments in mixed-integer linear programming
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Benchmarking optimization software with performance profiles.
This page was built for publication: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
