Pages that link to "Item:Q1268263"

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

Displaying 39 items.

• Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← 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)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← 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)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• The polynomial robust knapsack problem (Q2103045) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
• Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← 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)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← 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)
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
• Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
• Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)