The following pages link to Quadratic knapsack problems (Q3912370):
Displaying 50 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- An ejection chain approach for the quadratic multiple knapsack problem (Q323171) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← 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)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← 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)
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- A dynamic programming algorithm for multiple-choice constraints (Q798257) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- A quadratic integer program for the location of interacting hub facilities (Q1092794) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- On the magnetisation of the ground states in two dimensional Ising spin glasses (Q1344221) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← 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)
- On the product knapsack problem (Q1653266) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← 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)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- A reduction technique for weighted grouping problems (Q1848576) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
