At the frontier of operations research, algorithms, and constraint programming, Meinolf Sellmann's research focuses on hard combinatorial feasibility and optimization problems as they arise in the context of real-world applications such as airline crew scheduling, automatic recording, and capacitated network design. He is especially interested in the integration of methods from mathematical programming, approximation theory, and constraint propagation, which has proven very successful in boosting the solution efficiency for discrete feasibility and optimization problems.
Before receiving his doctorate in 2002 from the University of Paderborn, Germany, Professor Sellmann worked for Bell Labs, Lucent Technologies, in Murray Hill. In March 2003, he returned to the US as a postdoc at Cornell University and joined Brown University as an Assistant Professor in September 2004.
On The Web:
Are you Meinolf Sellmann? Click here to edit your research profile.