Pages that link to "Item:Q2433806"
From MaRDI portal
The following pages link to Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806):
Displaying 11 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
