Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
From MaRDI portal
(Redirected from Publication:623798)
assignment problemHungarian algorithmopen shop schedulingsatellite switched time division multiple access
History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Discrete location and assignment (90B80) History of operations research and mathematical programming (90-03)
Recommendations
Cites work
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- A Combinatorial Algorithm
- Being in the Right Place at the Right Time
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Jacobi's bound for a diffiety defined by a quasi-regular system
- On Kuhn's Hungarian Method?A tribute from Hungary
- On Representatives of Subsets
- On the History of Combinatorial Optimization (Till 1960)
- Open Shop Scheduling to Minimize Finish Time
- Open shop, satellite communication and a theorem by Egerváry (1931)
- Paths, Trees, and Flowers
Cited in
(9)- Editorial: Computational advances in combinatorial optimization
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A look at the past and present of optimization - an editorial
- A tale of three eras: the discovery and rediscovery of the Hungarian method
- Special issue in honour of Jenő Egerváry
- Purcell's method, Egerváry and related results
- On Kuhn's Hungarian Method?A tribute from Hungary
- Depth search: remarks on the history of algorithms
This page was built for publication: Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623798)
