Pages that link to "Item:Q703909"

The following pages link to An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909):

Displaying 35 items.

• Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
• Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← 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)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
• Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← 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 computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← 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)
• Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
• Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
• Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← 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)
• A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams (Q5214092) (← links)
• Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
• Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)