The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
From MaRDI portal
Recommendations
- A computational study on the quadratic knapsack problem with multiple constraints
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Generalized quadratic multiple knapsack problem and two solution approaches
- Integer quadratic knapsack problems
- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Cites work
- A comparison of optimization methods for multi-objective constrained bin packing problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Achieving domain consistency and counting solutions for dispersion constraints
- Algorithm 457: finding all cliques of an undirected graph
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Failure-directed search for constraint-based scheduling
- scientific article; zbMATH DE number 2144493 (Why is no real title available?)
- McCormick-Based Relaxations of Algorithms
- Principles and Practice of Constraint Programming – CP 2004
Cited in
(4)- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Measures of balance in combinatorial optimization
- Strategic oscillation for the quadratic multiple knapsack problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
This page was built for publication: The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085468)
