Pages that link to "Item:Q1970334"

The following pages link to Hybrid evolutionary algorithms for graph coloring (Q1970334):

Displaying 36 items.

• The general \(\alpha \)-decomposition problem of fuzzy relations (Q2456464) (← links)
• A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
• A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
• An ant-based algorithm for coloring graphs (Q2467354) (← links)
• Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
• Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
• An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
• An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
• Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
• An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
• Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
• Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths (Q2485164) (← links)
• An exact method for graph coloring (Q2489282) (← links)
• A survey of local search methods for graph coloring (Q2489304) (← links)
• Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
• Distance-constrained grid colouring (Q2629563) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
• AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
• Lower Bounds for the Minimal Sum Coloring Problem (Q2883634) (← links)
• The Relation Between Complete and Incomplete Search (Q2950519) (← links)
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• Three tabu search methods for the MI-FAP applied to 802.11 networks (Q3163671) (← links)
• A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
• (Q3390728) (← links)
• Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
• Genetic local search for multi-objective combinatorial optimization (Q5956204) (← links)
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
• A massively parallel evolutionary algorithm for the partial Latin square extension problem (Q6106593) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)