The following pages link to (Q3835301):
Displaying 28 items.
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← 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)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- Exact Solution of the Quadratic Knapsack Problem (Q4427369) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
