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

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

European Journal of Operational Research

Saved in:
Bibliographic Details
Main Authors: Zhang, C.W., Ong, H.L.
Other Authors: INDUSTRIAL & SYSTEMS ENGINEERING
Format: Article
Published: 2014
Subjects:
ε-Nondominated solution
Integer programming
Knapsack problem
LP-based heuristic
Multiple objective programming
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
Description
Summary:European Journal of Operational Research

Similar Items