Pages that link to "Item:Q4427369"
From MaRDI portal
The following pages link to Exact Solution of the Quadratic Knapsack Problem (Q4427369):
Displaying 50 items.
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← 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)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
- Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach (Q744689) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← 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)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← 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 quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← 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. 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)
- 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)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← 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)
- 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)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← 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)
