scientific article; zbMATH DE number 956851
From MaRDI portal
Publication:5687258
zbMath0864.90117MaRDI QIDQ5687258
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Related Items
Graph colouring approaches for a satellite range scheduling problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, Variable ordering for decision diagrams: a portfolio approach, Regular-SAT: A many-valued approach to solving combinatorial problems, Simple decentralized graph coloring, Incremental list coloring of graphs, parameterized by conservation, An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs, A new vertex coloring heuristic and corresponding chromatic number, An investigation into two bin packing problems with ordering and orientation implications, A variable neighborhood search for graph coloring., An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, Generalised graph colouring by a hybrid of local search and constraint programming, An ant-based algorithm for coloring graphs, Generating Feasible Schedules for a Pick-up and Delivery Problem, Using an Incomplete Version of Dynamic Backtracking for Graph Colouring, An improved ant colony optimisation heuristic for graph colouring, Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem, A wide-ranging computational comparison of high-performance graph colouring algorithms, Measuring instance difficulty for combinatorial optimization problems, On the application of graph colouring techniques in round-robin sports scheduling, Iterated greedy for the maximum diversity problem, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, An adaptive, multiple restarts neural network algorithm for graph coloring, Graph coloring by multiagent fusion search, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, An information-based neural approach to generic constraint satisfaction., On the complexity of unfrozen problems, SeaPearl: a constraint programming solver guided by reinforcement learning
