DIMACS

MaRDI QIDQ20231swMATHFDO

Official website http://dimacs.rutgers.edu/Challenges/

Cited in

(only showing first 100 items - show all)

• Solving weighted MAX-SAT via global equilibrium search
• Approximating the maximum vertex/edge weighted clique using local search
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Solving similarity joins and range queries in metric spaces with the list of twin clusters
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• New stopping criteria for detecting infeasibility in conic optimization
• A new bidirectional search algorithm with shortened postprocessing
• Combinatorial optimization in system configuration design
• Learning action models from plan examples using weighted MAX-SAT
• Graph coloring by multiagent fusion search
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Reactive and dynamic local search for max-clique: engineering effective building blocks
• Models and heuristic algorithms for a weighted vertex coloring problem
• LP-oriented upper bounds for the weighted stability number of a graph
• A search space ``cartography for guiding graph coloring heuristics
• An effective local search for the maximum clique problem
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
• A memetic algorithm for graph coloring
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• An implementation of linear and nonlinear multicommodity network flows
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• CsegGraph
• A two-phase algorithm for solving a class of hard satisfiability problems
• A practical anti-degeneracy row selection technique in network linear programming
• The maximum clique problem
• Hyperheuristics
• LEDA
• Computing maximum mean cuts
• ManySAT
• March_eq
• NetworkX
• Pueblo
• emili
• QAPLIB
• HGS-CVRP
• CAPOPT
• ACVIZ
• HHBQP
• SDPLIB
• SNAP
• SNDlib
• Massively parallel augmenting path algorithms for the assignment problem
• Efficient massively parallel implementation of some combinatorial algorithms
• TSPLIB
• UnitWalk
• Chair-free Berge graphs are perfect
• Max Horn SAT and the minimum cut problem in directed hypergraphs
• GRASP
• Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Equivalent literal propagation in the DLL procedure
• On the limit of branching rules for hard random unsatisfiable 3-SAT
• xQx
• Finding all maximal cliques in dynamic graphs
• GraphBase
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Convex optimization for the densest subgraph and densest submatrix problems
• SatEx
• ClaiMaker
• SATLIB
• VLSI
• TABARIS
• UBCSAT
• PSATO
• EVE-OPT
• ABACUS
• DSATUR
• CALMA
• On the first-order estimation of multipliers from Kuhn-Tucker systems
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
• Coloration neighbourhood search with forward checking
• Heuristics for semirandom graph problems
• Pajek
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• An algorithm based on tabu search for satisfiability problem
• Annealed replication: A new heuristic for the maximum clique problem
• Nagging: A scalable fault-tolerant paradigm for distributed search
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• VSDP
• SDPT3
• SteinLib
• OGDF
• EasyLocal++
• OR-Library
• Empirical analysis of algorithms for the shortest negative cost cycle problem
• Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
• Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
• Pajek datasets
• SNAP
• Detecting robust cliques in graphs subject to uncertain edge failures
• A robust and scalable algorithm for the Steiner problem in graphs
• A new heuristic algorithm to solve the maximum independent set problem
• GeoSteiner
• Walksat
• Efficiently enumerating all maximal cliques with bit-parallelism
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• A strongly polynomial contraction-expansion algorithm for network flow problems
• Carousel greedy: a generalized greedy algorithm with applications in optimization

This page was built for software: DIMACS