Herve L M Kerivin

Position:
Assistant Professor of Mathematical Sciences

Education:
PhD, Combinatorial Optimization, University Blaise Pascal, Clermont-Ferrand, France, 2000
MS, Operations Reseacrh, University Joseph Fourier, Grenoble, France, 1995
BS, Mathematics and Computer Science, University of Brest, France, 1994

Professional Interests:
Mixed-integer programming and robust network optimization; applications in telecommunication and transportation systems

Professional Activities:
Member of INFORMS

Selected Publications:

• R. Sirdey and H. Kerivin. A branch-and-cut algorithm for a resource-constrained scheduling problem, RAIRO-Operations Research 41 (2007), 235-251.
• W. Ben-Ameur and H. Kerivin. Routing of uncertain traffic demands, Optimization and Engineering 6 (2005), 283-313.
• F. Barahona and H. Kerivin. Separation of partition inequalities with terminals, Discrete Optimization 1 (2004), 29-140.

Related Web Sites:
Department of Mathematical Sciences.