Pages that link to "Item:Q580987"

The following pages link to Using tabu search techniques for graph coloring (Q580987):

Displaying 50 items.

• A parallel tabu search algorithm for large traveling salesman problems (Q1329785) (← links)
• A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115) (← links)
• Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) (← links)
• Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
• The tabu search metaheuristic: How we used it (Q1356212) (← links)
• Modelling constant weight codes using tabu search (Q1384374) (← links)
• Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
• A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
• A variable neighborhood search for graph coloring. (Q1410622) (← links)
• Using tabu search with longer-term memory and relaxation to create examination timetables. (Q1417490) (← links)
• Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
• Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← 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)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
• Tabu search with simple ejection chains for coloring graphs (Q1861926) (← links)
• Common due-date determination and sequencing using tabu search (Q1915955) (← links)
• A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
• Applying tabu search to determine new Ramsey graphs (Q1918865) (← links)
• Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
• Tabu search for graph partitioning (Q1919841) (← links)
• Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
• Tabu search for the BWC problem (Q1928269) (← links)
• A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
• An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• A user's guide to tabu search (Q2366991) (← links)
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996) (← links)
• Part type selection problem in flexible manufacturing systems: Tabu search algorithms (Q2367007) (← links)
• On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
• Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
• CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
• Artificial life techniques for load balancing in computational grids (Q2459370) (← 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)
• Another look at graph coloring via propositional satisfiability (Q2467359) (← 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)
• A tabu search algorithm for structural software testing (Q2482359) (← links)