Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Business Systems Research Journal
Volume 3 (2012): Issue 2 (September 2012)
Open Access
An experimental comparison of some heuristics for cardinality constrained bin packing problem
Maja Remic
Maja Remic
,
Gašper Žerovnik
Gašper Žerovnik
and
Janez Žerovnik
Janez Žerovnik
| Sep 19, 2012
Business Systems Research Journal
Volume 3 (2012): Issue 2 (September 2012)
"Innovative Approaches to Operations Research Methodology and Its Applications in Business, Economics, Management and Social Sciences" co-published with the Slovenian Society INFORMATIKA - Section for Operational Research (SDI-SOR)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Sep 19, 2012
Page range:
57 - 63
DOI:
https://doi.org/10.2478/v10305-012-0013-1
Keywords
cardinality constrained bin packing problem heuristics
,
approximation algorithm
This content is open access.
Maja Remic
University of Ljubljana, Ljubljana, Slovenia
Gašper Žerovnik
Reactor Physics Division, Jožef Stefan Institute, Ljubljana, Slovenia
Janez Žerovnik
Faculty for Mechanical Engineering, University of Ljubljana, Ljubljana, Slovenia