Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
European Journal of Operational Research
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/87247 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
id |
sg-nus-scholar.10635-87247 |
---|---|
record_format |
dspace |
spelling |
sg-nus-scholar.10635-872472023-08-22T07:56:39Z Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic Zhang, C.W. Ong, H.L. INDUSTRIAL & SYSTEMS ENGINEERING ε-Nondominated solution Integer programming Knapsack problem LP-based heuristic Multiple objective programming European Journal of Operational Research 159 3 545-557 EJORD 2014-10-07T10:25:58Z 2014-10-07T10:25:58Z 2004-12-16 Article Zhang, C.W., Ong, H.L. (2004-12-16). Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic. European Journal of Operational Research 159 (3) : 545-557. ScholarBank@NUS Repository. 03772217 http://scholarbank.nus.edu.sg/handle/10635/87247 000223454400002 Scopus |
institution |
National University of Singapore |
building |
NUS Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NUS Library |
collection |
ScholarBank@NUS |
topic |
ε-Nondominated solution Integer programming Knapsack problem LP-based heuristic Multiple objective programming |
spellingShingle |
ε-Nondominated solution Integer programming Knapsack problem LP-based heuristic Multiple objective programming Zhang, C.W. Ong, H.L. Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
description |
European Journal of Operational Research |
author2 |
INDUSTRIAL & SYSTEMS ENGINEERING |
author_facet |
INDUSTRIAL & SYSTEMS ENGINEERING Zhang, C.W. Ong, H.L. |
format |
Article |
author |
Zhang, C.W. Ong, H.L. |
author_sort |
Zhang, C.W. |
title |
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
title_short |
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
title_full |
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
title_fullStr |
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
title_full_unstemmed |
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic |
title_sort |
solving the biobjective zero-one knapsack problem by an efficient lp-based heuristic |
publishDate |
2014 |
url |
http://scholarbank.nus.edu.sg/handle/10635/87247 |
_version_ |
1776258714923171840 |