Pages that link to "Item:Q875597"
From MaRDI portal
The following pages link to The quadratic knapsack problem -- a survey (Q875597):
Displaying 50 items.
- Knapsack (Q16891) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems (Q1615968) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← 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)
- On the product knapsack problem (Q1653266) (← links)
- Product allocation to different types of distribution center in retail logistics networks (Q1681420) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Approximation of the quadratic knapsack problem (Q1694783) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Optimal allocation of buffer times to increase train schedule robustness (Q1752165) (← 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)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Knapsack problems with dependencies through non-additive measures and Choquet integral (Q2140163) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A mathematical programming approach to overlapping community detection (Q2162210) (← links)
- On the rectangular knapsack problem (Q2168057) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- Dual mean field annealing scheme for binary optimization under linear constraints (Q2183203) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← 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)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
