Bound reduction using pairs of linear inequalities
- 26 January 2012
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (3) , 787-819
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear ProgramsINFORMS Journal on Computing, 2010
- Branching and bounds tighteningtechniques for non-convex MINLPOptimization Methods and Software, 2009
- The global solver in the LINDO APIOptimization Methods and Software, 2009
- Reformulations in Mathematical Programming: Definitions and SystematicsRAIRO - Operations Research, 2009
- Global optimization problems and domain reduction strategiesMathematical Programming, 2009
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Deterministic global optimization using interval constraint propagation techniquesRAIRO - Operations Research, 2004
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960