Pages that link to "Item:Q1332814"
From MaRDI portal
The following pages link to A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814):
Displaying 12 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization (Q1862178) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming (Q4229486) (← links)
- An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998) (← links)
- A penalty for concave minimization derived from the Tuy cutting plane (Q4287999) (← links)
- Cutting Planes for Low-Rank-Like Concave Minimization Problems (Q5322008) (← links)
- (Q5462190) (← links)
