Pages that link to "Item:Q2892339"

The following pages link to Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction (Q2892339):

Displaying 27 items.

• Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
• Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach (Q744689) (← 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)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• On the product knapsack problem (Q1653266) (← 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)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• The polynomial robust knapsack problem (Q2103045) (← 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)
• 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)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← links)
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)