Pages that link to "Item:Q3200886"

The following pages link to An algorithm for concave integer minimization over a polyhedron (Q3200886):

Displaying 5 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)
• 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)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)