EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"cardinality constrained bin packing problem heuristics"
Narrow search

Narrow search

Year of publication
Subject
All
approximation algorithm 1 cardinality constrained bin packing problem heuristics 1
Online availability
All
Free 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Remic, Maja 1 Žerovnik, Gašper 1 Žerovnik, Janez 1
Published in...
All
Business Systems Research 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
An experimental comparison of some heuristics for cardinality constrained bin packing problem
Remic, Maja; Žerovnik, Gašper; Žerovnik, Janez - In: Business Systems Research 3 (2012) 2, pp. 57-63
Background: Bin packing is an Nphard optimization problem of packing items of given sizes into minimum number of capacitylimited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of...
Persistent link: https://www.econbiz.de/10011019973
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...