Pages that link to "Item:Q3960473"

The following pages link to An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (Q3960473):

Displaying 7 items.

• A branch and search algorithm for a class of nonlinear knapsack problems (Q594771) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• An algorithm for concave integer minimization over a polyhedron (Q3200886) (← links)
• Formulation for a fixed-charge, separable nonlinear production planning problem (Q3339648) (← links)
• A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685) (← links)
• Reduction of nonlinear integer separable programming problems^∗ (Q3807881) (← links)