Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication

DOI10.1007/s10100-009-0125-zzbMath1204.90003MaRDI QIDQ623798

Silvano Martello

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0125-z

zbMATH Keywords

assignment problem; Hungarian algorithm; open shop scheduling; satellite switched time division multiple access

Mathematics Subject Classification ID

01A60: History of mathematics in the 20th century

01A70: Biographies, obituaries, personalia, bibliographies

90B80: Discrete location and assignment

90-03: History of operations research and mathematical programming

90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming

Related Items

Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Special issue in honour of Jenő Egerváry, Editorial: Computational advances in combinatorial optimization, A look at the past and present of optimization - an editorial, Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Open shop, satellite communication and a theorem by Egerváry (1931)
• Jacobi's bound for a diffiety defined by a quasi-regular system
• Being in the Right Place at the Right Time
• Open Shop Scheduling to Minimize Finish Time
• On Kuhn's Hungarian Method?A tribute from Hungary
• On Representatives of Subsets
• On the History of Combinatorial Optimization (Till 1960)
• Paths, Trees, and Flowers
• A Combinatorial Algorithm