Lakmali Weerasena presents: A Local-search Algorithm and a Tolerance Function for Multi-objective Combinatorial Optimization Problems. If you go What: Math Colloquium: Lakmali Weerasena When: Friday, Oct. 20 at 2 p.m. Where: EMCS 422 Admission: This talk may be appropriate for undergraduate and graduate students with an interest in operations research and applications. A multi-objective combinatorial optimization (MOCO) problem consists a solution set, known as Pareto set, due to the conflicting nature…
In his lecture, “In Praise of a Forgotten Virtue: Moderation in the Twenty-First Century,” Aurelian Craiutu explores questions surrounding the forgotten virtue and the relationship moderation has—or should have—with politics.
The University of Tennessee at Chattanooga’s College of Engineering and Computer Science will honor the late Dr. Francis “Frank” Jones for his years of service to the college.
