Pages that link to "Item:Q1268263"

The following pages link to Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263):

Displayed 13 items.

• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) ‎ (← links)
• The quadratic knapsack problem -- a survey (Q875597) ‎ (← links)
• The submodular knapsack polytope (Q1040079) ‎ (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) ‎ (← 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)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) ‎ (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) ‎ (← links)
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) ‎ (← links)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) ‎ (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) ‎ (← links)
• On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) ‎ (← links)
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) ‎ (← links)