Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2768352
Jump to:navigation, search

zbMath1012.90049MaRDI QIDQ2768352

George S. Lueker, Edward G. jun. Coffman

Publication date: 19 June 2003


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptotic approximation schemeextensible bin packing


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (7)

Approximation schemes for the generalized extensible bin packing problem ⋮ An improved typology of cutting and packing problems ⋮ Approximation algorithms for extensible bin packing ⋮ Vector assignment schemes for asymmetric settings ⋮ On-line scheduling with extendable working time on a small number of machines ⋮ Optimal preemptive scheduling for general target functions ⋮ Adaptive Bin Packing with Overflow




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768352&oldid=15647644"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 15:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki