scientific article; zbMATH DE number 956852
From MaRDI portal
zbMath0864.90120MaRDI QIDQ5687259
Mark Parker, Jennifer K. Ryan, Fred Glover
Publication date: 22 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
tabu searchbranch-and-boundadaptive depth procedurecolor conditioned dependencycoloring a graphdepth and width
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An effective matheuristic for the capacitated total quantity discount problem, An enumerative algorithm for the frequency assignment problem, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, A proposal for a hybrid meta-strategy for combinatorial optimization problems, An ant-based algorithm for coloring graphs, An exact method for graph coloring, A branch-and-cut algorithm for graph coloring, Improving the extraction and expansion method for large graph coloring, Frozen development in graph coloring, A memetic algorithm for graph coloring, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
