Pages that link to "Item:Q3757685"
From MaRDI portal
The following pages link to A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685):
Displayed 9 items.
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)