On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope

DOI10.1007/s10957-011-9863-xzbMath1226.90079OpenAlexW2035207516WikidataQ115146367 ScholiaQ115146367MaRDI QIDQ650234

Ahmad M. Justanieah, Neil Thomas, Vasilios I. Manousiouthakis

Publication date: 25 November 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9863-x

zbMATH Keywords

global optimizationnonconvex programmingbranch-and-bound\(N\)-dimensional polytopes

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved branch and bound algorithm for minimum concave cost network flow problems
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• Concave minimization via conical partitions and polyhedral outer approximation
• Global and local search algorithms for concave cost transshipment problems
• On the use of cuts in reverse convex programs
• An outer approximation method for globally minimizing a concave function over a compact convex set
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A finite algorithm for global minimization of separable concave programs
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
• Probabilistic local search algorithms for concave cost transportation network problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• Introduction to global optimization
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Separable concave minimization via partial outer approximation and branch and bound
• Approximating the Single-Sink Link-Installation Problem in Network Design
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• A note on the convergence of an algorithm for nonconvex programming problems
• A method for globally minimizing concave functions over convex sets
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• An algorithm for nonconvex programming problems
• A linear max—min problem
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
• Concave Programming Applied to a Special Class of 0-1 Integer Programs
• A Lagrangian based branch-and-bound algorithm for production-transportation problems
• Finite exact branch-and-bound algorithms for concave minimization over polytopes
• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.

This page was built for publication: On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope