Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
From MaRDI portal
Publication:3978838
DOI10.1287/opre.39.3.378zbMath0739.90055MaRDI QIDQ3978838
Catherine A. Schevon, David S. Johnson, L. A. McGeoch, Cecilia R. Aragon
Publication date: 25 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.3.378
graph coloring; Simulated annealing; local optimization; optimal planning; number partitioning; extremal permutation problems
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C27: Combinatorial optimization
05C15: Coloring of graphs and hypergraphs
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Iterative coloring extension of a maximum clique, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, On the recursive largest first algorithm for graph colouring, Experiments on the minimum linear arrangement problem, GLOBAL CONFORMATION OPTIMIZATION OF MIXED CLUSTERS USING A GENETIC ALGORITHM, On the chromatic number of graphs, The noising methods: A generalization of some metaheuristics, A physicist's approach to number partitioning, Routing and wavelength assignment by partition colouring, A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks, An effective hybrid algorithm for university course timetabling, A cooperative search method for the \(k\)-coloring problem, Long-term staffing based on qualification profiles, A fuzzy clustering method of construction of ontology-based user profiles, Combinatorial optimization in system configuration design, Graph coloring by multiagent fusion search, Heuristics and exact methods for number partitioning, Models and heuristic algorithms for a weighted vertex coloring problem, A search space ``cartography for guiding graph coloring heuristics, A memetic algorithm for graph coloring, Autocorrelation coefficient for the graph bipartitioning problem, COSINE: A new graph coloring algorithm, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, An adaptive, multiple restarts neural network algorithm for graph coloring, General local search methods, The life span method -- a new variant of local search, Path optimization for graph partitioning problems, A complete anytime algorithm for number partitioning, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A new tabu search procedure for an audit-scheduling problem, Local optima topology for the \(k\)-coloring problem, The hardest constraint problems: A double phase transition, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, Simulated annealing and tabu search: Lessons from a line search, Applying tabu search with influential diversification to multiprocessor scheduling, Exploiting the deep structure of constraint problems, A comparison of \(p\)-dispersion heuristics, Constructing efficient simulated annealing algorithms, Unit disk graph recognition is NP-hard, Job-shop scheduling: Computational study of local search and large-step optimization methods, Simulated annealing for manufacturing systems layout design, Improvement heuristics for the vehicle routing problem based on simulated annealing, A composite heuristic for the single machine early/tardy job scheduling problem., A robust simulated annealing based examination timetabling system., A variable neighborhood search for graph coloring., A Lagrangian reconstruction of GENET, Compiling constraint satisfaction problems, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, Guided local search and its application to the traveling salesman problem, Constraint satisfaction problems: Algorithms and applications, Determination of optimal path under approach and exit constraints, An information-based neural approach to generic constraint satisfaction., Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Efficient heuristics for robot acquisition planning for a CIM system, A comparison of neighborhood search techniques for multi-objective combinatorial problems, Easily searched encodings for number partitioning, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Focused simulated annealing search: An application to job shop scheduling, Genetic and hybrid algorithms for graph coloring, Problem space local search for number partitioning, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, On the classification of NP-complete problems in terms of their correlation coefficient, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Problems of discrete optimization: challenges and main approaches to solve them, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Compiling problem specifications into SAT, CHECKCOL: improved local search for graph coloring, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, An ant-based algorithm for coloring graphs, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Another look at graph coloring via propositional satisfiability, Efficient algorithms for finding critical subgraphs, An adaptive memory algorithm for the \(k\)-coloring problem, An improved ant colony optimisation heuristic for graph colouring, Constraint satisfaction methods for solving the staff transfer problem, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, An evolutionary approach for bandwidth multicoloring problems, Embedding a novel objective function in a two-phased local search for robust vertex coloring, A survey of local search methods for graph coloring, Randomized methods for the number partitioning problem, A simulated annealing algorithm for determining the thickness of a graph, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Heuristics for the maximum outerplanar subgraph problem, CsegGraph: a graph colouring instance generator
