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:"bin packing with conflicts"
Narrow search

Narrow search

Year of publication
Subject
All
Algorithm 1 Algorithmus 1 Evolutionary algorithm 1 Evolutionärer Algorithmus 1 Heuristics 1 Heuristik 1 Mathematical programming 1 Mathematische Optimierung 1 Operations Research 1 Operations research 1 Packing problem 1 Packproblem 1 Theorie 1 Theory 1 bin packing 1 bin packing with conflicts 1 branch-and-price-and-cut 1 exact algorithm 1
more ... less ...
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
English 1
Author
All
Baldacci, Roberto 1 Lim, Andrew 1 Luo, Zhixing 1 Wei, Lijun 1
Published in...
All
INFORMS journal on computing : JOC 1
Source
All
ECONIS (ZBW) 1
Showing 1 - 1 of 1
Cover Image
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun; Luo, Zhixing; Baldacci, Roberto; Lim, Andrew - In: INFORMS journal on computing : JOC 32 (2020) 2, pp. 428-443
Persistent link: https://www.econbiz.de/10012242773
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...