Matrices Associated With the Hitchcock Problem

DOI10.1145/321138.321139zbMath0107.25002OpenAlexW2001005029MaRDI QIDQ3294251

N. S. Mendelsohn, A. L. Dulmage

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

Related Items (4)

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

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