Pages that link to "Item:Q4287998"
From MaRDI portal
The following pages link to An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998):
Displaying 14 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← 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)
- Nonlinear programming for multiperiod capacity planning in a manufacturing system (Q1278476) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
- An algorithm for concave integer minimization over a polyhedron (Q3200886) (← links)
- A finite algorithm for concave minimization over a polyhedron (Q3705227) (← links)
- A penalty for concave minimization derived from the Tuy cutting plane (Q4287999) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
