A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing
Year of publication: |
2009
|
---|---|
Authors: | Lewis, Rhyd |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 7, p. 2295-2310
|
Subject: | Graphentheorie | Graph theory | Packproblem | Packing problem | Heuristik | Heuristics | Algorithmus | Algorithm | Vergleich | Comparison |
-
Bin packing with "Largest In bottom" constraint : tighter bounds and generalizations
Dosa, Gyorgy, (2013)
-
Stabilized branch-and-price algorithms for vector packing problems
Heßler, Katrin, (2018)
-
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Barkel, Mathijs, (2025)
- More ...
-
Metaheuristics can solve sudoku puzzles
Lewis, Rhyd, (2007)
-
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
Lewis, Rhyd, (2012)
-
McCollum, Barry, (2010)
- More ...