An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
From MaRDI portal
Publication:5139608
DOI10.1287/ijoc.2018.0840OpenAlexW2944611440WikidataQ127912923 ScholiaQ127912923MaRDI QIDQ5139608
No author found.
Publication date: 9 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0840
Related Items (8)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints ⋮ A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Lagrangian matheuristics for the quadratic multiple knapsack problem ⋮ Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem ⋮ A logarithmic descent direction algorithm for the quadratic knapsack problem ⋮ A branch-and-bound algorithm for the quadratic multiple knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Generalized quadratic multiple knapsack problem and two solution approaches
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- A branch and search algorithm for a class of nonlinear knapsack problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The service allocation problem at the Gioia Tauro maritime terminal
- The quadratic knapsack problem -- a survey
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- An algorithm for the generalized quadratic assignment problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- An exact algorithm for large multiple knapsack problems
- Heuristic algorithms for the multiple knapsack problem
- An improved partial solution to the task assignment and multiway cut problems
- Linear programming for the \(0-1\) quadratic knapsack problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- The nonlinear knapsack problem - algorithms and applications
- On linearization techniques for budget-constrained binary quadratic programming problems
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Lagrangean methods for 0-1 quadratic problems
- An algorithm for the multiprocessor assignment problem
- An algorithm for finding the \(K\)-best allocations of a tree structured program
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Strategic oscillation for the quadratic multiple knapsack problem
- A variable-grouping based genetic algorithm for large-scale integer programming
- The Quadratic Assignment Problem
- A Memetic Heuristic for the Generalized Quadratic Assignment Problem
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
- Efficient Production-Distribution System Design
- BiqCrunch
- A Linear Programming Approach to the Cutting-Stock Problem
- Quadratic knapsack problems
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- A branch and bound algorithm for the generalized assignment problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An algorithm for 0-1 multiple-knapsack problems
- Exact Solution of the Quadratic Knapsack Problem
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Solving Multiple Knapsack Problems by Cutting Planes
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
- Best reduction of the quadratic semi-assignment problem
This page was built for publication: An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
