Pages that link to "Item:Q1613374"

The following pages link to A fast algorithm for the maximum clique problem (Q1613374):

Displaying 50 items.

• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
• A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
• Reducing graph coloring to clique search (Q326946) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
• Permutation codes with specified packing radius (Q356723) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
• Coloring the nodes of a directed graph (Q399510) (← links)
• Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• On risk-averse maximum weighted subgraph problems (Q405680) (← links)
• Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
• Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
• Finding quasi core with simulated stacked neural networks (Q526647) (← links)
• Russian doll search for the Steiner triple covering problem (Q644513) (← 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)
• An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
• Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem (Q721172) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• Quantum contextuality with stabilizer states (Q742771) (← links)
• A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
• A new table of permutation codes (Q766240) (← links)
• Quasi-symmetric designs on 56 points (Q825929) (← links)
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• A clique algorithm for standard quadratic programming (Q955308) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• Integral point sets over \(\mathbb Z_n^m\) (Q1026112) (← links)
• Optimal \((n,4,2)\)-OOC of small orders. (Q1428520) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)