MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 1 documents found, showing 1 through 1.
ATOM RSS
  • Contents  
  • by U. Faigle (cologne, J. L. Hurink (enschede, F. Maffioli (milan, R. Schrader, J. L. Hurink, W. Kern, G. F. Post, G. J. Still, N. M. M. De Abreu, P. Hansen, C. S. Oliveira, L. S. De Lima — 2007
  • … for the variable size bin packing problem with minimum filling constraint S. Coene, F.C.R. Spieksma 29 A latency…
  • Add To MetaCart
Help! Showing 1 through 1.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB