DIMACS
The DIMACS Implementation Challenges address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails. Experimentation also brings algorithmic questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data structures. It provides an opportunity to develop and test problem instances, instance generators, and other methods of testing and comparing performance of algorithms. And it is a step in technology transfer by providing leading edge implementations of algorithms for others to adapt. The information on challenges includes pointers to WWW/FTP sites that include calls for participation, algorithm implementations, instance generators, bibliographies, and other electronic artifacts. The challenge organizers are also producing refereed volumes in the AMS-DIMACS book series; these contain selected papers from the workshops that culminate each challenge. If you are using the implementations, generators or other files, please take a few minutes to tell us how you are using it, what applications you are working on, and how it impacts your work. We need to document the impact of this research to the agencies and foundations that support it - your stories are essential to doing that. Send comments to: froberts@dimacs.rutgers.edu
Keywords for this software
References in zbMATH (referenced in 326 articles )
Showing results 1 to 20 of 326.
Sorted by year (- Akiba, Takuya; Iwata, Yoichi: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (2016)
- De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
- Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanità, Laura: On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (2016)
- Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
- Hamadi, Youssef; Jabbour, Saïd; Saïs, Lakhdar: What we can learn from conflicts in propositional satisfiability (2016)
- Luz, Carlos J.: A characterization of the weighted Lovász number based on convex quadratic programming (2016)
- Morrison, David R.; Sewell, Edward C.; Jacobson, Sheldon H.: Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (2016)
- Napov, Artem; Notay, Yvan: An efficient multigrid method for graph Laplacian systems (2016)
- O’Donoghue, Brendan; Chu, Eric; Parikh, Neal; Boyd, Stephen: Conic optimization via operator splitting and homogeneous self-dual embedding (2016)
- Pajouh, Foad Mahdavi; Balasundaram, Balabhaskar; Hicks, Illya V.: On the 2-club polytope of graphs (2016)
- Sun, Defeng; Toh, Kim-Chuan; Yang, Liuqin: An efficient inexact ABCD method for least squares semidefinite programming (2016)
- Wang, Yang; Hao, Jin-Kao; Glover, Fred; Lü, Zhipeng; Wu, Qinghua: Solving the maximum vertex weight clique problem via binary quadratic programming (2016)
- Williamson, Matthew; Eirinakis, Pavlos; Subramani, K.: Fast algorithms for the undirected negative cost cycle detection problem (2016)
- Balaprakash, Prasanna; Birattari, Mauro; Stützle, Thomas; Dorigo, Marco: Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (2015)
- Balint, Adrian; Belov, Anton; Järvisalo, Matti; Sinz, Carsten: Overview and analysis of the SAT challenge 2012 solver competition (2015)
- Bärmann, Andreas; Liers, Frauke; Martin, Alexander; Merkert, Maximilian; Thurner, Christoph; Weninger, Dieter: Solving network design problems via iterative aggregation (2015)
- Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
- Drexl, Michael; Schneider, Michael: A survey of variants and extensions of the location-routing problem (2015)
- Feldmann, Andreas Emil: Fixed parameter approximations for $k$-center problems in low highway dimension graphs (2015)
- Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian: A $(1+\varepsilon)$ -embedding of low highway dimension graphs into bounded treewidth graphs (2015)