Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic

10.1016/S0377-2217(03)00420-X

Saved in:
Bibliographic Details
Main Authors: Zhang, C.W., Ong, H.L.
Other Authors: INDUSTRIAL & SYSTEMS ENGINEERING
Format: Article
Published: 2014
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/63326
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-63326
record_format dspace
spelling sg-nus-scholar.10635-633262023-10-27T07:36: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 10.1016/S0377-2217(03)00420-X European Journal of Operational Research 159 3 545-557 EJORD 2014-06-17T07:02:46Z 2014-06-17T07:02:46Z 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. https://doi.org/10.1016/S0377-2217(03)00420-X 03772217 http://scholarbank.nus.edu.sg/handle/10635/63326 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 10.1016/S0377-2217(03)00420-X
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/63326
_version_ 1781782231739531264