A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints

DOI10.1287/ijoc.1040.0078zbMath1241.90107OpenAlexW2106153506MaRDI QIDQ2892278

Laszlo Ladanyi, John J. Forrest, Jayant R. Kalagnanam

Publication date: 18 June 2012

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

Full work available at URL: https://semanticscholar.org/paper/8488fd4adacda266f3b082c1847216d78bd3ec6f

zbMATH Keywords

integer programmingcolumn generation\texttt{MIPLIB}multiple knapsack problem\texttt{mkc7}

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Integrated Charge Batching and Casting Width Selection at Baosteel, A nested column generation algorithm to the meta slab allocation problem in the steel making industry, Bid evaluation in procurement auctions with piecewise linear supply curves, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

Uses Software

• MIPLIB
• mkc7