Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
From MaRDI portal
Recommendations
- On quadratic transportation cost inequalities
- Optimal transportation for a quadratic cost with convex constraints and applications
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
- Approximating the minimum quadratic assignment problems
- A note on the quickest minimum cost transshipment problem
- scientific article; zbMATH DE number 5995154
- Fast transport optimization for Monge costs on the circle
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Algorithms for the minimax transportation problem
Cited in
(13)- An algorithm for computing the restriction s|caffold assignment problem in computational biology
- Minimum-weight perfect matching for nonintrinsic distances on the line
- Resilient capacity-aware routing
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- scientific article; zbMATH DE number 1003236 (Why is no real title available?)
- Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
- The complexity of finding small separators in temporal graphs
- Simple linear flow decomposition algorithms on trees, circles, and augmented trees
- Algorithms for the transportation problem in geometric settings
- New variants of perfect non-crossing matchings
- Local matching indicators for concave transport costs
This page was built for publication: Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840222)
