Robert G. Bland

Robert G. Bland is a Professor at Cornell University's School of Operations Research and Information Engineering (ORIE). He joined Cornell in 1978 after roles at SUNY Binghamton and research fellowships in Belgium. He is affiliated with the Center for Applied Mathematics and specializes in linear programming, combinatorial optimization, and network flow theory. His research emphasizes algorithmic efficiency, duality theory, and applications in scheduling and resource allocation.

Education:

• B.S. (1969), Cornell University
• M.S. (1972), Cornell University
• Ph.D. (1974), Cornell University

Research Interests: Focuses on linear programming duality, combinatorial abstractions, computational methods for optimization, and applications in logistics, scheduling, and scientific computing. Notable work includes the development of new pivoting rules for the simplex method and empirical studies of network flow algorithms.

Publications Insight: His work spans foundational LP theory, combinatorial optimization, and algorithmic analysis. Key themes include duality frameworks, Camion bases, and large-scale TSP applications in crystallography. Recent publications address abstract dualities and historical perspectives on pioneers like D. Ray Fulkerson.

Awards: Recipient of Cornell's prestigious Merrill Outstanding Educator Award (3 times) and twice recognized as ORIE's best teacher. Member of the Mathematical Optimization Society and American Society for Engineering Education.

Grants & Projects: Conducted service projects on vehicle routing and examination scheduling. Collaborated on computational studies of min cost flow algorithms and network flow performance.

Labs/Teams: Active in ORIE's research groups, particularly those focused on optimization theory and computational methods.