The following pages link to (Q5687246):
Displaying 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)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← 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)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← 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)
- 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)