Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Approximating Multi-objective Knapsack Problems
HTML
Details
Locations
Year:
2001
Type:
conference-paper
Source:
Lecture notes in computer science
Parent work:
Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8–10, 2001 Proceedings
DOI:
10.1007/3-540-44634-6_20
Authors:
Thomas Erlebach,
Hans Kellerer,
Ulrich Pferschy
Institutions:
ETH Zurich,
Computer Engineering and Networks Laboratory,
University of Graz
Language:
English
Topic:
Optimization and Packing Problems
Subfield:
Industrial and Manufacturing Engineering
Field:
Engineering
Domain:
Physical Sciences
Keywords:
multi-objective knapsack problem,
Pareto front,
approximation methods,
polynomial-time approximation scheme,
fully polynomial time approximation scheme,
Pareto optimal solutions,
linear programming
show all 7
Open Access status:
closed
OpenAlex ID:
W1701984136
FWCI:
11.61
Cites:
12
Cited by:
38
Related to:
10