Pages that link to "Item:Q2489304"
From MaRDI portal
The following pages link to A survey of local search methods for graph coloring (Q2489304):
Displaying 50 items.
- Optimisation of gravity-fed water distribution network design: a critical review (Q257205) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← 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)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- The \(k\)-coloring fitness landscape (Q491197) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Using tabu search techniques for graph coloring (Q580987) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← 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)
- 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)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← 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)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- Tabu search for the BWC problem (Q1928269) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← 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)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
