Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins.

Ilan Doron Arad Ariel Kulik Hadas Shachnai

Published in: CoRR (2022)

Keyphrases

bin packing
assembly line balancing
graph colouring
cutting stock
greedy algorithm
search tree
linear combination
packing problem
traveling salesman problem
combinatorial optimization
scheduling problem
multi dimensional
particle swarm optimization