Decomposition in general mathematical programming
From MaRDI portal
Publication:689140
DOI10.1007/BF01580620zbMATH Open0784.90107OpenAlexW2072677159MaRDI QIDQ689140FDOQ689140
Authors: Olaf E. Flippo, Alexander H. G. Rinnooy Kan 
Publication date: 9 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580620
Recommendations
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Generalized Benders decomposition
- Decomposition Principle for Linear Programs
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Cross decomposition for mixed integer programming
- On the convergence of cross decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-Level Planning
- On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
- An elementary survey of general duality theory in mathematical programming
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Mixed-integer quadratic programming
- Generalized Linear Programming Solves the Dual
- A resource decomposition algorithm for general mathematical programs
- A generalized Benders decomposition approach to reactive source planning in power systems
- On general decomposition schemes in mathematical programming
- Title not available (Why is that?)
- A note on Benders' decomposition in mixed-integer quadratic programming
Cited In (17)
- Problems related to estimating the coefficients of exact penalty functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint
- The Benders Dual Decomposition Method
- Title not available (Why is that?)
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Convergence behavior of decomposition algorithms for linear programs
- Decomposition in global optimization
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- A decomposition approach for solving a broadcast domination network design problem
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Title not available (Why is that?)
- Inexact solution of NLP subproblems in MINLP
This page was built for publication: Decomposition in general mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689140)
