Open shop, satellite communication and a theorem by Egerváry (1931)

Authors:
Mauro Dell'Amico;Silvano Martello
Affiliations:
Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Operations Research Letters
Year:
1996

Citing 2
Cited 2

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Ant colony optimization for satellite customer assignment

ICUCT'06 Proceedings of the 1st international conference on Ubiquitous convergence technology
Genetic algorithm for satellite customer assignment

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a combinatorial optimization problem arising, in different forms, in scheduling theory and in satellite communication theory. We show that two classical algorithms, independently obtained in these two domains, implement a technique developed in 1931 by Egervary.