LP based heuristics for the multiple knapsack problem with assignment restrictions

DOI10.1007/s10479-006-0048-1zbMath1106.90063OpenAlexW2047708507MaRDI QIDQ863573

Geir Dahl, Njål Foldnes

Publication date: 5 February 2007

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10852/36885

zbMATH Keywords

randomized roundingtraffic routingmultiple knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

The food bank resource allocation problem ⋮ Multiple subset sum with inclusive assignment set restrictions ⋮ The assignment and loading transportation problem

Uses Software

• CPLEX
• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for large multiple knapsack problems
• Rounding algorithms for covering problems
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• A PTAS for the multiple subset sum problem with different knapsack capacities
• Solving Multiple Knapsack Problems by Cutting Planes
• Maximum matching in a convex bipartite graph

This page was built for publication: LP based heuristics for the multiple knapsack problem with assignment restrictions