A heuristic approach for searching (d, n)-packing colorings of infinite lattices.

Danilo Korze Ziga Markus Aleksander Vesel

Published in: Discret. Appl. Math. (2019)

Keyphrases

packing problem
search strategies
strip packing
simulated annealing
tabu search
bin packing
heuristic solution
solution quality
heuristic methods
maximum profit
objective function
exact algorithms
beam search
depth first search
rough sets
dynamic programming
search algorithm
optimal solution