A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
type: Item
instance of: scholarly article
title: A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
zbMATH Open document ID: 1158.90415
author: Rhyd Lewis
published in: Computers \& Operations Research
publication date: 2009-04-17T00:00:00Z
full work available at URL: Lewis, R General Purpose Hill Climbing.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5544751
zbMATH Keywords: metaheuristics
zbMATH Keywords: packing
zbMATH Keywords: graph colouring
zbMATH Keywords: grouping problems
Wikidata QID: Q56212225
describes a project that uses: Bison
describes a project that uses: DIMACS
MaRDI profile type: Publication
OpenAlex ID: W2156051492
cites work: A robust simulated annealing based examination timetabling system.
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
cites work: A study of permutation operators for minimum span frequency assignment using an order based representation
cites work: 25 pretty graph colouring problems
cites work: Q4198056
cites work: Q4289899
cites work: Variants of simulated annealing for the examination timetabling problem
cites work: Ant colony optimization and local search for bin packing and cutting stock problems
cites work: New methods to color the vertices of a graph
cites work: A graph coloring algorithm for large scheduling problems
cites work: Using an incomplete version of dynamic backtracking for graph colouring
cites work: A Column Generation Approach for Graph Coloring
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: Graph coloring with adaptive evolutionary algorithms
cites work: Q2779807
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: Applications of evolutionary computing. EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002. Proceedings
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Using tabu search techniques for graph coloring
cites work: A variable neighborhood search for graph coloring.
cites work: Ants can colour graphs
cites work: An improved ant colony optimisation heuristic for graph colouring
cites work: Q4879548
cites work: Q5687258
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: Q4012216
cites work: Almost all k-colorable graphs are easy to color
cites work: Heuristic solution of open bin packing problems
cites work: On method overfitting
cites work: Recent advances on two-dimensional bin packing problems
DOI: 10.1016/J.COR.2008.09.004
DBLP publication ID: journals/cor/Lewis09
description: scientific article; zbMATH DE number 5544751