A finite concave minimization algorithm using branch and bound and neighbor generation
From MaRDI portal
Publication:1330802
DOI10.1007/BF01096999zbMATH Open0819.90068MaRDI QIDQ1330802FDOQ1330802
Authors: Harold P. Benson, Serpil Sayın 
Publication date: 11 August 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A finite algorithm for globally minimizing a concave function under linear constraints and its applications
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- scientific article; zbMATH DE number 970356
- A finite algorithm for global minimization of separable concave programs
- scientific article; zbMATH DE number 2146951
- A simple finite cone covering algorithm for concave minimization
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Finite algorithms for global minimization of separable concave programs
Cites Work
- Constrained global optimization: algorithms and applications
- Methods for Global Concave Minimization: A Bibliographic Survey
- An algorithm for nonconvex programming problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximization of A convex quadratic function under linear constraints
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- On the global minimization of concave functions
- Optimal Facility Location with Concave Costs
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Checking local optimality in constrained quadratic programming is NP- hard
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- Concave minimization via conical partitions and polyhedral outer approximation
- An algorithm for concave integer minimization over a polyhedron
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- A finite algorithm for concave minimization over a polyhedron
- Title not available (Why is that?)
Cited In (6)
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Computational experience using an edge search algorithm for linear reverse convex programs
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
This page was built for publication: A finite concave minimization algorithm using branch and bound and neighbor generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330802)
