Pages that link to "Item:Q1268265"

The following pages link to Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265):

Displaying 24 items.

• Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
• Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
• On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← 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)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
• A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
• The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
• Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
• Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
• 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
• On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
• A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
• A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249) (← links)
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
• Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming (Q6102811) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)