scientific article; zbMATH DE number 1830744
From MaRDI portal
Publication:4778565
zbMath0997.68526MaRDI QIDQ4778565
Publication date: 18 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2125/21250313
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Exactly solving packing problems with fragmentation ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ A study on load-balanced variants of the bin packing problem ⋮ Approximation schemes for packing with item fragmentation ⋮ Bin packing with fragmentable items: presentation and approximations ⋮ The basic train makeup problem in shunting yards ⋮ Matrix columns allocation problems
This page was built for publication:
