Pages that link to "Item:Q580987"
From MaRDI portal
The following pages link to Using tabu search techniques for graph coloring (Q580987):
Displayed 50 items.
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- New secure partial encryption method for medical images using graph coloring problem (Q330803) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← 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 mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- Tabu search for large scale timetabling problems (Q806794) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- Simulated annealing: A tool for operational research (Q913662) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- Exchanges procedures for timetabling problems (Q1186312) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
- General local search methods (Q1268283) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Driving tabu search with case-based reasoning (Q1280158) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)