Pages that link to "Item:Q2456655"

The following pages link to A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655):

Displaying 40 items.

• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
• Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
• Variable space search for graph coloring (Q955321) (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← links)
• High-performance technique for satellite range scheduling (Q1652343) (← links)
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
• An efficient local search for the feedback vertex set problem (Q1736593) (← links)
• Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
• Optimization by ant algorithms: possible roles for an individual ant (Q1758036) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Coloring large graphs based on independent set extraction (Q1761974) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
• Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
• The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← 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)
• Metaheuristics for truck loading in the car production industry (Q2968504) (← 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)
• A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)
• A massively parallel evolutionary algorithm for the partial Latin square extension problem (Q6106593) (← links)