The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints

DOI10.1287/ijoc.2020.0983OpenAlexW3093212826MaRDI QIDQ5085468

Philippe Olivier, Gilles Pesant, Andrea Lodi

Publication date: 27 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.0983

zbMATH Keywords

integer programmingconstraint programmingbalancequadratic multiknapsack problem

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Measures of balance in combinatorial optimization

Uses Software

• libMC
• Algorithm 457

Cites Work

• Unnamed Item
• A comparison of optimization methods for multi-objective constrained bin packing problems
• Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• McCormick-Based Relaxations of Algorithms
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Algorithm 457: finding all cliques of an undirected graph
• Failure-Directed Search for Constraint-Based Scheduling
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints