Blossom IV
From MaRDI portal
Software:16944
No author found.
Related Items (36)
Ond-threshold graphs andd-dimensional bin packing ⋮ Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm ⋮ Adaptive paired comparison design ⋮ Unnamed Item ⋮ PackLib\(^{2}\): an integrated library of multi-dimensional packing problems ⋮ Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs ⋮ Incremental assignment problem ⋮ Nonparametric Tests for Homogeneity Based on Non-Bipartite Matching ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bayesian locally optimal design of knockout tournaments ⋮ Convolutional neural network based decoders for surface codes ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Reinforcement learning for optimal error correction of toric codes ⋮ Unnamed Item ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem ⋮ MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ Minimum-weight perfect matching for nonintrinsic distances on the line ⋮ Multilevel refinement for combinatorial optimisation problems ⋮ The Stochastic Inventory Routing Problem with Direct Deliveries ⋮ Error-free milestones in error prone measurements ⋮ Dynamic ordering for a parallel block-Jacobi SVD algorithm ⋮ Computing Minimum-Weight Perfect Matchings ⋮ Heuristics for the mixed swapping problem ⋮ Blossom V: A new implementation of a minimum cost perfect matching algorithm ⋮ A simple approximation algorithm for the weighted matching problem ⋮ A memetic algorithm to schedule planned maintenance for the national grid ⋮ Implementing weighted b-matching algorithms ⋮ Implementation of O ( nm log n ) weighted matchings in general graphs ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ A branch-and-price algorithm for scheduling sport leagues ⋮ Fast algorithms for the undirected negative cost cycle detection problem
This page was built for software: Blossom IV
