4.7 Article

A branch-and-bound algorithm for the quadratic multiple knapsack problem

Related references

Note: Only part of the references are listed.
Article Management

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem

Laura Galli et al.

Summary: The Quadratic Multiple Knapsack Problem generalizes two well-known combinatorial optimization problems and proposes polynomial-size linear models and upper bounds. Surrogate and Lagrangian relaxations are used, and the effectiveness of the Lagrangian relaxation is compared when applied to a quadratic formulation and a Level 1 reformulation linearization. The proposed methods are evaluated through extensive computational experiments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Article Computer Science, Interdisciplinary Applications

An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating

David Bergman

INFORMS JOURNAL ON COMPUTING (2019)

Article Computer Science, Interdisciplinary Applications

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem

Jin Qin et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

Article Management

An ejection chain approach for the quadratic multiple knapsack problem

Bo Peng et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Computer Science, Interdisciplinary Applications

Generalized quadratic multiple knapsack problem and two solution approaches

Tugba Sarac et al.

COMPUTERS & OPERATIONS RESEARCH (2014)

Article Management

Efficient production-distribution system design

S Elhedhli et al.

MANAGEMENT SCIENCE (2005)

Article Computer Science, Interdisciplinary Applications

Approximation algorithms for the multiple knapsack problem with assignment restrictions

M Dawande et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2000)