Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
From MaRDI portal
Publication:817192
DOI10.1007/s10479-005-3451-0zbMath1091.90056OpenAlexW2049847730MaRDI QIDQ817192
Ignacio E. Grossmann, Sang Bum Lee
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3451-0
global optimizationmixed-integer programminggeneralized disjunctive programminglogic-based programming
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A review of recent advances in global optimization, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
Uses Software
Cites Work
- A hierarchy of relaxations for linear generalized disjunctive programming
- Valid inequalities for mixed 0-1 programs
- Partitioning procedures for solving mixed-variables programming problems
- An algorithm for disjunctive programs
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- A global optimization algorithm for linear fractional and bilinear programs
- Mixed logical-linear programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Generalized Benders decomposition
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Outline of an algorithm for integer solutions to linear programs
- An Automatic Method of Solving Discrete Programming Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A tree-search algorithm for mixed integer programming problems
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
