LP based heuristics for the multiple knapsack problem with assignment restrictions
From MaRDI portal
Publication:863573
DOI10.1007/S10479-006-0048-1zbMATH Open1106.90063OpenAlexW2047708507MaRDI QIDQ863573FDOQ863573
Authors: 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
Recommendations
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- A class of generalized greedy algorithms for the multi-knapsack problem
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Approximability of two variants of multiple knapsack problems
- A procedure-based heuristic for 0-1 multiple knapsack problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- An exact algorithm for large multiple knapsack problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum matching in a convex bipartite graph
- A PTAS for the multiple subset sum problem with different knapsack capacities
- Rounding algorithms for covering problems
- Solving Multiple Knapsack Problems by Cutting Planes
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Title not available (Why is that?)
Cited In (7)
- The food bank resource allocation problem
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network
- Multiple subset sum with inclusive assignment set restrictions
- An LP-based metaheuristic procedure for the k-sequential generalized assignment problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Time-sharing scheduling with tolerance capacities
- The assignment and loading transportation problem
Uses Software
This page was built for publication: LP based heuristics for the multiple knapsack problem with assignment restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863573)
