Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
10.1016/S0377-2217(03)00420-X
Saved in:
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 |
Similar Items
-
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014) -
An efficient solution to biobjective generalized assignment problem
by: Zhang, C.W., et al.
Published: (2014) -
Heuristic algorithms for solving a class of multiobjective zero-one programming problems
by: ZHANG CAIWEN
Published: (2010) -
Multiple knapsack problem with inter-related items and its applications to real world problems
by: ANG JUAY CHIN
Published: (2010) -
A parametric approach for a nonlinear discrete location problem
by: Sun, J., et al.
Published: (2013)