Scaling: A general framework

DOI10.1080/02331938608843121MaRDI QIDQ3730337zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

blossom algorithmmax flow-min costoptimum b-matchingpseudopolynomial algorithmScalingtotally unimodular problemstransportation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2050051
• The theory of scaling
• Scaling procedures. Issues and applications
• Scaling laws
• The nature of generalized scales
• scientific article; zbMATH DE number 4152431
• Measures of Scalability
• scientific article; zbMATH DE number 7112232

Cites work

• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3779067 (Why is no real title available?)
• Local Unimodularity in the Matching Polytope
• Mixed-integer programming -- 1968 and thereafter
• Odd Minimum Cut-Sets and b-Matchings
• Paths, Trees, and Flowers
• Polynomial algorithms for a class of linear programs
• The ellipsoid method and its consequences in combinatorial optimization
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Variational schemes of magnetohydrodynamics in an arbitrary coordinate system

Cited in

(5)

• A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
• Polynomial Scaling
• scientific article; zbMATH DE number 1819850 (Why is no real title available?)
• Scaled Pivots and Scaled Partial Pivoting Strategies
• A scaling algorithm for polynomial constraint satisfaction problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730337)