Pages that link to "Item:Q4372880"

The following pages link to Efficient Methods For Solving Quadratic 0–1 Knapsack Problems (Q4372880):

Displaying 18 items.

• 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)
• Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← 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)
• The polynomial robust knapsack problem (Q2103045) (← links)
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← 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 branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249) (← links)