Scaling: A general framework

DOI10.1080/02331938608843121zbMath0596.90056OpenAlexW1971432514MaRDI QIDQ3730337

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843121

zbMATH Keywords

transportationScalingpseudopolynomial algorithmblossom algorithmmax flow-min costoptimum b-matchingtotally unimodular problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixed-integer programming -- 1968 and thereafter
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• The ellipsoid method and its consequences in combinatorial optimization
• Variational schemes of magnetohydrodynamics in an arbitrary coordinate system
• Odd Minimum Cut-Sets and b-Matchings
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Local Unimodularity in the Matching Polytope
• Polynomial algorithms for a class of linear programs
• Paths, Trees, and Flowers
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: Scaling: A general framework