A finite concave minimization algorithm using branch and bound and neighbor generation
From MaRDI portal
Publication:1330802
DOI10.1007/BF01096999zbMath0819.90068MaRDI QIDQ1330802
Harold P. Benson, Serpil Sayın
Publication date: 11 August 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Related Items (4)
Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ Subdivision of simplices relative to a cutting plane and finite concave minimization ⋮ Computational experience using an edge search algorithm for linear reverse convex programs ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global minimization of concave functions
- Concave minimization via conical partitions and polyhedral outer approximation
- Constrained global optimization: algorithms and applications
- Checking local optimality in constrained quadratic programming is NP- hard
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- An algorithm for concave integer minimization over a polyhedron
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A finite algorithm for concave minimization over a polyhedron
- Methods for Global Concave Minimization: A Bibliographic Survey
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- An algorithm for nonconvex programming problems
- Maximization of A convex quadratic function under linear constraints
- Optimal Facility Location with Concave Costs
- Solving the Fixed Charge Problem by Ranking the Extreme Points
This page was built for publication: A finite concave minimization algorithm using branch and bound and neighbor generation
