Pages that link to "Item:Q3200886"
From MaRDI portal
The following pages link to An algorithm for concave integer minimization over a polyhedron (Q3200886):
Displaying 17 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- A simplicial algorithm for concave minimization and its performance as a heuristic tool (Q934181) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- A general algorithm for determining all essential solutions and inequalities for any convex polyhedron (Q1339125) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- A finite algorithm for concave minimization over a polyhedron (Q3705227) (← links)
- An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
