Cited in
(45)- Bayesian locally optimal design of knockout tournaments
- Multilevel refinement for combinatorial optimisation problems
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Fast algorithms for the undirected negative cost cycle detection problem
- scientific article; zbMATH DE number 1568937 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1445280 (Why is no real title available?)
- Implementation of O ( nm log n ) weighted matchings in general graphs
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Adaptive paired comparison design
- Ond-threshold graphs andd-dimensional bin packing
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Incremental assignment problem
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- A Lagrangian approach for minimum cost single round robin tournaments
- Minimum-weight perfect matching for nonintrinsic distances on the line
- Dynamic ordering for a parallel block-Jacobi SVD algorithm
- A simple approximation algorithm for the weighted matching problem
- scientific article; zbMATH DE number 2068045 (Why is no real title available?)
- 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
- Packlib2
- VLSI
- MESHPART
- Blossom V
- MuRoCo
- Q-Morph
- Error-free milestones in error prone measurements
- Blossom-Quad
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- PyMatching
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- A memetic algorithm to schedule planned maintenance for the national grid
- Convolutional neural network based decoders for surface codes
- Implementing weighted b-matching algorithms
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems
- Blossom-Quad: a non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Computing Minimum-Weight Perfect Matchings
- XZZX
This page was built for software: Blossom IV
