Three enhancements for optimization-based bound tightening
- 17 June 2016
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 67 (4) , 731-757
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Mixed Integer Programming: Analyzing 12 Years of Progress2013
- Bound reduction using pairs of linear inequalitiesJournal of Global Optimization, 2012
- The Traveling Salesman Problem2011
- Feasibility-Based Bounds Tightening via Fixed Points2010
- Branching and bounds tighteningtechniques for non-convex MINLPOptimization Methods and Software, 2009
- Global optimization problems and domain reduction strategiesMathematical Programming, 2009
- Solving Real-World Linear Programs: A Decade and More of ProgressOperations Research, 2002
- Global optimization of mixed‐integer nonlinear problemsAIChE Journal, 2000
- A global optimization method, αBB, for general twice-differentiable constrained NLPs—II. Implementation and computational resultsComputers & Chemical Engineering, 1998
- {0, 1/2}-Chvátal-Gomory cutsMathematical Programming, 1996