This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...
We study the multiple objective discrete optimization (MODO) problem and propose two-stage optimization problems as subproblems to be solved to obtain efficient solutions. The mathematical structure ...
We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback