The following pages link to (Q5687246):
Displayed 50 items.
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators (Q1983019) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- A new oscillator coupling function for improving the solution of graph coloring problem (Q2127406) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance (Q2163799) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- An ant-based algorithm for coloring graphs (Q2467354) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- The state of SAT (Q2643296) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Classical benchmarking of Gaussian boson sampling on the Titan supercomputer (Q2681599) (← links)
- (Q2741514) (← links)