The following pages link to (Q3804448):
Displayed 12 items.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A computational evaluation of two subgradient search methods (Q1089257) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)