Pages that link to "Item:Q1001200"
From MaRDI portal
The following pages link to Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200):
Displaying 6 items.
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- (Q5021865) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
