Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
type: Item
instance of: scholarly article
title: Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
zbMATH Open document ID: 1204.90003
author: Silvano Martello
published in: CEJOR. Central European Journal of Operations Research
publication date: 2011-02-08T00:00:00Z
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 90-04
zbMATH DE Number: 5847886
zbMATH Keywords: assignment problem
zbMATH Keywords: Hungarian algorithm
zbMATH Keywords: open shop scheduling
zbMATH Keywords: satellite switched time division multiple access
MaRDI profile type: Publication
full work available at URL: s10100-009-0125-z
OpenAlex ID: W2143527576
cites work: Open shop, satellite communication and a theorem by Egerváry (1931)
cites work: A Combinatorial Algorithm
cites work: Paths, Trees, and Flowers
cites work: On Kuhn's Hungarian Method?A tribute from Hungary
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: On Representatives of Subsets
cites work: Being in the Right Place at the Right Time
cites work: Jacobi's bound for a diffiety defined by a quasi-regular system
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On the History of Combinatorial Optimization (Till 1960)
cites work: Q5817856
Wikidata QID: Q56851137
DOI: 10.1007/S10100-009-0125-Z
description: scientific article; zbMATH DE number 5847886