Pages that link to "Item:Q1009196"

The following pages link to Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196):

Displaying 31 items.

• Breakout local search for maximum clique problems (Q339563) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Fast local search for the maximum independent set problem (Q519101) (← links)
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• An effective local search for the maximum clique problem (Q1041822) (← links)
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
• Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
• PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
• Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
• Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling (Q2030368) (← links)
• Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
• Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
• Phased local search for the maximum clique problem (Q2369988) (← links)
• Finding near-optimal independent sets at scale (Q2401330) (← links)
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
• Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
• A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
• Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
• Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• An analysis of parameter adaptation in reactive tabu search (Q4979993) (← links)
• Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
• Reactive local search for the maximum clique problem (Q5943666) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)