Pages that link to "Item:Q1806683"
From MaRDI portal
The following pages link to A new upper bound for the 0-1 quadratic knapsack problem (Q1806683):
Displaying 21 items.
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- The generalized quadratic knapsack problem. A neuronal network approach (Q2507299) (← links)
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)