Matrices Associated With the Hitchcock Problem

DOI10.1145/321138.321139MaRDI QIDQ3294251zbMATH OpenOpenAlexFDO

Authors A. L. Dulmage, N. S. Mendelsohn

Publication date 1962

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321138.321139

zbMATH Keywords

combinatorics

Cited in

(5)

• Partitioning through projections: strong SDP bounds for large graph partition problems
• A two-stage hardware scheduler combining greedy and optimal scheduling
• Differentiators and the geometry of polynomials.
• The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov
• Support of extremal doubly stochastic arrays

This page was built for publication: Matrices Associated With the Hitchcock Problem

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