Pages that link to "Item:Q2890419"

The following pages link to Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem (Q2890419):

Displaying 18 items.

• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Dual mean field annealing scheme for binary optimization under linear constraints (Q2183203) (← links)
• Conference scheduling: a clustering-based approach (Q2242187) (← links)
• Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams (Q5214092) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)