Pages that link to "Item:Q3951912"
From MaRDI portal
The following pages link to Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (Q3951912):
Displaying 5 items.
- Complete collineations and blowing up determinantal ideals (Q796607) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- The geometry of complete linear maps (Q1823287) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
