COMBINATORIAL SCHEDULING: ON FINDING A PARTITION OF A FINITE SET WHICH MAXIMIZES A SET FUNCTION.

GORDON RAE SHERMAN, Purdue University

Abstract

Abstract not available

Degree

Ph.D.

Subject Area

Mathematics

Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server
.

Share

COinS