Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs

DOI10.1002/net.21507zbMath1338.90068OpenAlexW2005598837MaRDI QIDQ2811304

Balachandran Vaidyanathan

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21507

zbMATH Keywords

computational complexitytransportation problemassignment problemMonge matrixminimum cost flow problemnetworks flow algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Four-point conditions for the TSP: the complete complexity classification

Cites Work

• Unnamed Item
• Two special cases of the assignment problem
• A data structure for dynamic trees
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications
• The Factored Transportation Problem
• Fast Matching Algorithms for Points on a Polygon
• Instant transportation solutions
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Simple linear flow decomposition algorithms on trees, circles, and augmented trees
• Dynamic trees in practice

This page was built for publication: Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs