Solving matching problems with linear programming
From MaRDI portal
Recommendations
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A primal simplex variant for the maximum-flow problem
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An analysis of alternative strategies for implementing matching algorithms
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Odd Minimum Cut-Sets and b-Matchings
- Paths, Trees, and Flowers
- Solving large-scale matching problems efficiently: A new primal matching approach
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- The ellipsoid method and its consequences in combinatorial optimization
- Weakly bipartite graphs and the max-cut problem
Cited in
(37)- A cutting plane algorithm for a clustering problem
- A polyhedral approach to edge coloring
- Euclidean semi-matchings of random samples
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A cutting plane algorithm for the windy postman problem
- A branch-and-cut algorithm for vehicle routing problems
- A compact linear program for testing optimality of perfect matchings.
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- Combinatorial optimization and small polytopes
- A cutting plane algorithm for minimum perfect 2-matchings
- Facets and algorithms for capacitated lot sizing
- New primal and dual matching heuristics
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Cardinality-restricted chains and antichains in partially ordered sets
- Revisiting a cutting-plane method for perfect matchings
- Ordered weighted average combinatorial optimization: formulations and their properties
- Fast algorithms for the undirected negative cost cycle detection problem
- The cutting plane method is polynomial for perfect matchings
- Efficient approximation algorithms for weighted b-matching
- scientific article; zbMATH DE number 125292 (Why is no real title available?)
- Reducing Matching to Polynomial Size Linear Programming
- scientific article; zbMATH DE number 515943 (Why is no real title available?)
- scientific article; zbMATH DE number 1953187 (Why is no real title available?)
- Using matching to detect infeasibility of some integer programs
- scientific article; zbMATH DE number 4197736 (Why is no real title available?)
- Approximation algorithms in combinatorial scientific computing
- Convex quadratic programming approach
- Constraint relaxation for the discrete ordered median problem
- The biobjective minimum-cost perfect matching problem and Chinese postman problem
- Solving the minimum label spanning tree problem by mathematical programming techniques
- On cuts and matchings in planar graphs
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Engineering hypergraph b-matching algorithms
- Solving (large scale) matching problems combinatorially
- Solution of large-scale symmetric travelling salesman problems
- Facet identification for the symmetric traveling salesman polytope
- Undirected postman problems with zigzagging option: a cutting-plane approach
This page was built for publication: Solving matching problems with linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703653)
