Pages that link to "Item:Q4287998"

The following pages link to An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998):

Displaying 6 items.

• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← 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)
• 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)