Pages that link to "Item:Q2673234"
From MaRDI portal
The following pages link to A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234):
Displaying 11 items.
- 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)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- New algorithm for quadratic integer knapsack problems (Q2994046) (← links)
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits (Q6659822) (← links)