LP based heuristics for the multiple knapsack problem with assignment restrictions
type: Item
instance of: scholarly article
title: LP based heuristics for the multiple knapsack problem with assignment restrictions
zbMATH Open document ID: 1106.90063
author: Geir Dahl
author: Njål Foldnes
published in: Annals of Operations Research
publication date: 2007-02-05T00:00:00Z
full work available at URL: http://hdl.handle.net/10852/36885
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5122243
zbMATH Keywords: multiple knapsack problem
zbMATH Keywords: randomized rounding
zbMATH Keywords: traffic routing
describes a project that uses: CPLEX
describes a project that uses: Knapsack
describes a project that uses: MULKNAP
MaRDI profile type: Publication
OpenAlex ID: W2047708507
cites work: Rounding algorithms for covering problems
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: Maximum matching in a convex bipartite graph
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: An exact algorithm for large multiple knapsack problems
cites work: Q3993418
cites work: A PTAS for the multiple subset sum problem with different knapsack capacities
cites work: Q4938889
cites work: Q4198056
cites work: Q4836494
DOI: 10.1007/S10479-006-0048-1
description: scientific article; zbMATH DE number 5122243