The following pages link to (Q5687246):
Displayed 50 items.
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- The combinatorics of pivoting for the maximum weight clique. (Q703275) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Weakening conflicting information for iterated revision and knowledge integration (Q814566) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- Some spin glass ideas applied to the clique problem (Q885046) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Spectral upper bounds for the order of a \(k\)-regular induced subgraph (Q984870) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- 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)
- 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)
- 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)
- 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)
- (Q2741514) (← links)