Cited in
(only showing first 100 items - show all)- Toward leaner binary-clause reasoning in a satisfiability solver
- Positive-instance driven dynamic programming for treewidth
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Incorporating bounds from decision diagrams into integer programming
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Strengthening Chvátal-Gomory cuts for the stable set problem
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Two novel evolutionary formulations of the graph coloring problem
- scientific article; zbMATH DE number 1985299 (Why is no real title available?)
- An exact algorithm for minimizing vertex guards on art galleries
- A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
- Iterated greedy for the maximum diversity problem
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An information-based neural approach to generic constraint satisfaction.
- A branch-and-cut algorithm for the edge interdiction clique problem
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- Graph coloring lower bounds from decision diagrams
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem
- Continuous cubic formulations for cluster detection problems in networks
- The quickhull algorithm for convex hulls
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Partitioning methods for satisfiability testing on large formulas
- New methods for 3-SAT decision and worst-case analysis
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- A biobjective Dijkstra algorithm
- Phased local search for the maximum clique problem
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Fast algorithms for the undirected negative cost cycle detection problem
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- Two new predictor-corrector algorithms for second-order cone programming
- A novel evolutionary formulation of the maximum independent set problem
- The possibilistic Horn non-clausal knowledge bases
- Parsimonious formulations for low-diameter clusters
- Resolving Braess's paradox in random networks
- A new branch-and-cut approach for the generalized regenerator location problem
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- An adaptive memory algorithm for the k-coloring problem
- Generalised graph colouring by a hybrid of local search and constraint programming
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Maximum independent sets of the 120-cell and other regular polyhedra
- Compiling problem specifications into SAT
- POPMUSIC for the travelling salesman problem
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- An exact method for graph coloring
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- DPLL: the core of modern satisfiability solvers
- The maximum clique problem
- A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
- On implementing push-relabel method for the maximum flow problem
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- Heuristic and metaheuristic methods for computing graph treewidth
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
- An exact algorithm for the maximum probabilistic clique problem
- Characteristics of the maximal independent set ZDD
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- An analysis of parameter adaptation in reactive tabu search
- Implementing efficient All solutions SAT solvers
- Customizable contraction hierarchies
- The state of SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- A Wide Branching Strategy for the Graph Coloring Problem
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Solving the Distance-Based Critical Node Problem
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- Avoiding bad steps in Frank-Wolfe variants
- Distance-Preserving Graph Contractions
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- The vertex \(k\)-cut problem
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- On the independent set problem in random graphs
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- scientific article; zbMATH DE number 7310218 (Why is no real title available?)
- A biased random-key genetic algorithm for data clustering
- The penalized Fischer-Burmeister SOC complementarity function
- Ap-cone sequential relaxation procedure for 0-1 integer programs
- Treewidth computations. II. Lower bounds
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
- Efficient transitive closure of sparse matrices over closed semirings
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Candidate sets for alternative routes in road networks
- A perspective on certain polynomial-time solvable classes of satisfiability
- Incremental list coloring of graphs, parameterized by conservation
- The maximum clique interdiction problem
- Equivalent literal propagation in the DLL procedure
This page was built for software: DIMACS
