scientific article; zbMATH DE number 956839
From MaRDI portal
Publication:5687246
zbMath0875.68678MaRDI QIDQ5687246
Michael A. Trick, David S. Johnson
Publication date: 13 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items
Annealed replication: A new heuristic for the maximum clique problem, A new oscillator coupling function for improving the solution of graph coloring problem, Phased local search for the maximum clique problem, Parallel Maximum Clique Algorithms with Applications to Network Analysis, Using SVM to combine global heuristics for the standard quadratic problem, A review on algorithms for maximum clique problems, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, Fast Cluster Detection in Networks by First Order Optimization, Variable ordering for decision diagrams: a portfolio approach, Spectral Bounds for the k-Regular Induced Subgraph Problem, The state of SAT, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Fixed interval scheduling: models, applications, computational complexity and algorithms, A new exact maximum clique algorithm for large and massive sparse graphs, Spectrum graph coloring and applications to Wi-Fi channel assignment, Simple decentralized graph coloring, \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Unnamed Item, Some spin glass ideas applied to the clique problem, An opposition-based memetic algorithm for the maximum quasi-clique problem, A Max-SAT Inference-Based Pre-processing for Max-Clique, Unconstrained formulation of standard quadratic optimization problems, Characteristics of the maximal independent set ZDD, An interdisciplinary experimental evaluation on the disjunctive temporal problem, Recycling inequalities for robust combinatorial optimization with budget uncertainty, An exact algorithm for the maximum quasi‐clique problem, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism, Classical benchmarking of Gaussian boson sampling on the Titan supercomputer, A General Regularized Continuous Formulation for the Maximum Clique Problem, Upper and lower bounds based on linear programming for the b-coloring problem, Positive-instance driven dynamic programming for treewidth, An improved bit parallel exact maximum clique algorithm, Quantum annealing of the graph coloring problem, A variable neighborhood search for graph coloring., BiqBin: Moving Boundaries for NP-hard Problems by HPC, Coordinated cutting plane generation via multi-objective separation, Recognition of tractable satisfiability problems through balanced polynomial representations, A Direct Algorithm for Multi-valued Bounded Model Checking, Combining VNS with constraint programming for solving anytime optimization problems, An efficient solver for weighted Max-SAT, Finding large cliques in sparse semi-random graphs by simple randomized search heuristics, A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique, Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm, Using critical sets to solve the maximum independent set problem, Compiling problem specifications into SAT, A sequential elimination algorithm for computing bounds on the clique number of a graph, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators, An ant-based algorithm for coloring graphs, An adaptive memory algorithm for the \(k\)-coloring problem, Improving ADMMs for solving doubly nonnegative programs through dual factorization, A branch-and-price approach for the maximum weight independent set problem, Hybrid evolutionary algorithm for the b-chromatic number, An effective heuristic algorithm for sum coloring of graphs, The combinatorics of pivoting for the maximum weight clique., A branch-and-cut algorithm for graph coloring, Variable neighborhood search for the maximum clique, Algorithm portfolios, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Probabilistic subproblem selection in branch-and-bound algorithms, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, Spectral upper bounds for the order of a \(k\)-regular induced subgraph, Bucket elimination for multiobjective optimization problems, Upper bounds on the Laplacian spread of graphs, Projection Methods in Conic Optimization, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Approximating the maximum vertex/edge weighted clique using local search, Simple ingredients leading to very efficient heuristics for the maximum clique problem, An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique, Branch decompositions and minor containment, Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, Exact bounds on the order of the maximum clique of a graph., An analysis of parameter adaptation in reactive tabu search, Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection, Finding the maximum multi improvement on neighborhood exploration, SATO: An efficient propositional prover, Graph coloring by multiagent fusion search, A search space ``cartography for guiding graph coloring heuristics, Positive-Instance Driven Dynamic Programming for Treewidth., A memetic algorithm for graph coloring, An order-based algorithm for minimum dominating set with application in graph mining, Algorithms for the generalized independent set problem based on a quadratic optimization approach, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, Quartic formulation of standard quadratic optimization problems, Continuous cubic formulations for cluster detection problems in networks, The resolution complexity of random graph \(k\)-colorability, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING, Avoiding bad steps in Frank-Wolfe variants, Backjump-based backtracking for constraint satisfaction problems, Weakening conflicting information for iterated revision and knowledge integration
Uses Software
