Nonconvex optimization over a polytope using generalized capacity improvement
From MaRDI portal
Publication:1904646
DOI10.1007/BF01097058zbMath0841.90103OpenAlexW2039686952MaRDI QIDQ1904646
Publication date: 7 January 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01097058
branch-and-boundnonconvex optimizationdomain reductioncapacity improvementfixed-charge and quadratic concave minimization
Related Items
Unnamed Item, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved branch and bound algorithm for minimum concave cost network flow problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Constrained global optimization: algorithms and applications
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A finite algorithm for global minimization of separable concave programs
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- A finite algorithm for concave minimization over a polyhedron
- Methods for Global Concave Minimization: A Bibliographic Survey
- Concave Minimization Via Collapsing Polytopes
- A method for globally minimizing concave functions over convex sets
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
