Solving (large scale) matching problems combinatorially
From MaRDI portal
computational resultsshortest augmenting pathassignment start procedurefast matching algorithmslarge scale matchingsparse subgraphtwo-phase strategy
Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- scientific article; zbMATH DE number 515943
- Solving large-scale matching problems efficiently: A new primal matching approach
- Computing large matchings fast
- Finding large stable matchings
- Solving matching problems efficiently in bipartite graphs
- scientific article; zbMATH DE number 3921983
- Complexity of matching problems
- Certain NP-complete matching problems
- Simultaneous matchings: Hardness and approximation
- scientific article; zbMATH DE number 1405497
Cites work
- scientific article; zbMATH DE number 3900499 (Why is no real title available?)
- An in-core/out-of-core method for solving large scale assignment problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Maximum matching and a polyhedron with 0,1-vertices
- On the use of optimal fractional matchings for solving the (integer) matching problem
- Solving large-scale matching problems efficiently: A new primal matching approach
- Solving matching problems with linear programming
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
Cited in
(16)- Fast algorithms for the undirected negative cost cycle detection problem
- An in-core/out-of-core method for solving large scale assignment problems
- Solving large-scale matching problems efficiently: A new primal matching approach
- Matching problems with generalized upper bound side constraints
- Provably good solutions for the traveling salesman problem
- scientific article; zbMATH DE number 515943 (Why is no real title available?)
- scientific article; zbMATH DE number 3900499 (Why is no real title available?)
- scientific article; zbMATH DE number 679866 (Why is no real title available?)
- An efficient matching algorithm applied in statistical physics
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- On the ground-state threshold in random two-dimensional Ising \(\pm J\) models
- Building and combining matching algorithms
- scientific article; zbMATH DE number 1003267 (Why is no real title available?)
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
- scientific article; zbMATH DE number 4197736 (Why is no real title available?)
This page was built for publication: Solving (large scale) matching problems combinatorially
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750322)
