Pages that link to "Item:Q2967622"
From MaRDI portal
The following pages link to A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622):
Displayed 17 items.
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Dual mean field annealing scheme for binary optimization under linear constraints (Q2183203) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- New concepts of principal component analysis based on maximum separation of clusters (Q5082987) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)