Results 181 to 190 of about 5,749 (206)
Some of the next articles are maybe not open access.
Strategic oscillation for the quadratic multiple knapsack problem
Computational Optimization and Applications, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos García-Martínez +4 more
openaire +1 more source
A Projection Method for the Integer Quadratic Knapsack Problem
Journal of the Operational Research Society, 1996Summary: We present a new branch-and-bound algorithm for solving a class of integer quadratic knapsack problems. A previously published algorithm solves the continuous variable subproblems in the branch-and-bound tree by performing a binary search over the breakpoints of a piecewise linear equation resulting from the Kuhn-Tucker conditions.
Bretthauer, Kurt M +2 more
openaire +2 more sources
A note on optimal solutions to quadratic knapsack problems
International Journal of Mathematical Modelling and Numerical Optimisation, 2010In this note we report our success in applying CPLEX's mixed integer quadratic programming (MIQP) solver to a set of standard quadratic knapsack test problems. The results we give show that this general purpose, commercial code outperformed a leading special purpose method reported in the literature by a wide margin.
Haibo Wang 0001 +2 more
openaire +1 more source
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
ORSA Journal on Computing, 1995We present a branch and bound algorithm for solving separable convex quadratic knapsack problems with lower and upper bounds on the integer variables. The algorithm solves a series of continuous quadratic knapsack problems via their Kuhn-Tucker conditions.
Kurt M. Bretthauer +2 more
openaire +1 more source
A branch-and-bound algorithm for the quadratic multiple knapsack problem
European Journal of Operational Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Local minima for indefinite quadratic knapsack problems
Mathematical Programming, 1992The paper deals with the following problem: minimize \(x^ T Dx+d^ T x\) subject to \(\ell_ i\leq x_ i\leq u_ i\;(i=1,\dots,n)\), \(a^ T x=g\), where \(x\in R^ n\), \(D\) is a diagonal matrix, \(d\) and \(a\) are \(n\)- vectors, \(\ell_ 1,\dots,\ell_ n\), \(u_ 1,\dots,u_ n\) and \(g\) are real numbers.
openaire +2 more sources
The generalized quadratic knapsack problem. A neuronal network approach
Neural Networks, 2006The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved ...
Pedro M. Talaván, Javier Yáñez
openaire +2 more sources
A Genetic Algorithm for the Quadratic Multiple Knapsack Problem
2007The Quadratic Multiple Knapsack Problem (QMKP) is a generalization of the quadratic knapsack problem, which is one of the well-known combinatorial optimization problems, from a single knapsack to k knapsacks with (possibly) different capacities.
Tugba Saraç, Aydin Sipahioglu
openaire +1 more source
Lagrangean methods for the 0–1 Quadratic Knapsack Problem
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michelon, Philippe, Veilleux, Louis
openaire +1 more source
The symmetric quadratic knapsack problem: approximation and scheduling applications
4OR, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans Kellerer, Vitaly A. Strusevich
openaire +2 more sources