swMATH4781MaRDI QIDQ16944FDOQ16944
Author name not available (Why is that?)
Official website: http://www2.isye.gatech.edu/~wcook/blossom4/
Cited In (42)
- Bayesian locally optimal design of knockout tournaments
- Linear time approximation algorithms for~degree~constrained subgraph problems
- PyMatching
- Multilevel refinement for combinatorial optimisation problems
- Title not available (Why is that?)
- Fast algorithms for the undirected negative cost cycle detection problem
- Nonparametric tests for homogeneity based on non-bipartite matching
- Reinforcement learning for optimal error correction of toric codes
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A branch-and-price algorithm for scheduling sport leagues
- Implementation of O ( nm log n ) weighted matchings in general graphs
- Title not available (Why is that?)
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Adaptive paired comparison design
- Ond-threshold graphs andd-dimensional bin packing
- Title not available (Why is that?)
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Incremental assignment problem
- Dynamic ordering for a parallel block-Jacobi SVD algorithm
- A Lagrangian approach for minimum cost single round robin tournaments
- Minimum-weight perfect matching for nonintrinsic distances on the line
- Title not available (Why is that?)
- A simple approximation algorithm for the weighted matching problem
- Blossom-Quad
- Heuristics for the mixed swapping problem
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- Error-free milestones in error prone measurements
- Blossom V
- MuRoCo
- Q-Morph
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- XZZX
- A memetic algorithm to schedule planned maintenance for the national grid
- Convolutional neural network based decoders for surface codes
- Implementing weighted b-matching algorithms
- Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Computing Minimum-Weight Perfect Matchings
This page was built for software: Blossom IV
