DIMACS

swMATH8221MaRDI QIDQ20231FDOQ20231

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Graph coloring lower bounds from decision diagrams
• Incorporating bounds from decision diagrams into integer programming
• A new branch-and-cut approach for the generalized regenerator location problem
• DPLL: the core of modern satisfiability solvers
• Nagging: A scalable fault-tolerant paradigm for distributed search
• Title not available (Why is that?)
• Ap-cone sequential relaxation procedure for 0-1 integer programs
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• Efficient transitive closure of sparse matrices over closed semirings
• Title not available (Why is that?)
• A competitive and cooperative approach to propositional satisfiability
• On biconnected and fragile subgraphs of low diameter
• Finding groups with maximum betweenness centrality
• Heuristics for semirandom graph problems
• Fast quasi-threshold editing
• Binary Steiner trees: structural results and an exact solution approach
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Algorithms and experiments: The new (and old) methodology
• A branch-price-and-cut algorithm for packing cuts in undirected graphs
• Graph signatures: identification and optimization
• Propositional SAT solving
• Title not available (Why is that?)
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• A new bidirectional search algorithm with shortened postprocessing
• On edge orienting methods for graph coloring
• A simulated annealing algorithm for determining the thickness of a graph
• Solution techniques for the large set covering problem
• Superlinear convergence of the affine scaling algorithm
• Mining relevant information on the Web: a clique-based approach
• Combining the scalability of local search with the pruning techniques of systematic search
• A two-phase algorithm for solving a class of hard satisfiability problems
• Chair-free Berge graphs are perfect
• Towards Bounded Model Checking for the Universal Fragment of TCTL
• Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• Experiments with a hybrid interior point/combinatorial approach for network flow problems
• On cycles and the stable multi-set polytope
• An implementation of Newton-like methods on nonlinearly constrained networks
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
• Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
• Combinatorial optimization in system configuration design
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• On exact solution approaches for the longest induced path problem
• Algorithms for searching paths in huge graphs
• Tabu search for the BWC problem
• Title not available (Why is that?)
• Towards a theory of practice in metaheuristics design: A machine learning perspective
• Programming for modular reconfigurable robots
• An order-based algorithm for minimum dominating set with application in graph mining
• A maximum edge-weight clique extraction algorithm based on branch-and-bound
• Solving partial constraint satisfaction problems with tree decomposition
• Title not available (Why is that?)
• The compressed differential heuristic
• Projection Methods in Conic Optimization
• Speeding up Martins' algorithm for multiple objective shortest path problems
• Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem
• The quickhull algorithm for convex hulls
• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Title not available (Why is that?)
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
• Title not available (Why is that?)
• Fast algorithms for the undirected negative cost cycle detection 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
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
• The maximum clique problem
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• Incremental list coloring of graphs, parameterized by conservation
• Minimum-cost flow algorithms: an experimental evaluation
• An integer programming framework for critical elements detection in graphs
• On the application of graph colouring techniques in round-robin sports scheduling
• An exact combinatorial algorithm for minimum graph bisection
• Authenticating Pervasive Devices with Human Protocols
• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Towards objective measures of algorithm performance across instance space
• Improved upper bounds for vertex cover
• A branch-and-bound approach for maximum quasi-cliques
• SATO: An efficient propositional prover
• Some spin glass ideas applied to the clique problem
• Local search and lower bounds for the patient admission scheduling problem
• Searching with iterated maps
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• A mathematical model and a metaheuristic approach for a memory allocation problem
• Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
• An improved SAT formulation for the social golfer problem
• Time-dependent SHARC-routing
• A search space ``cartography for guiding graph coloring heuristics
• Weakening conflicting information for iterated revision and knowledge integration
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• An efficient cost scaling algorithm for the assignment problem
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• New stopping criteria for detecting infeasibility in conic optimization
• Fortran subroutines for network flow optimization using an interior point algorithm
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring

This page was built for software: DIMACS