Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution. Develop a basic understanding of how linear and integer ...

A new principle for choosing portfolios based on historical returns data is introduced; the optimal portfolio based on this principle is the solution to a simple linear programming problem. This ...

This paper describes the development of a mixed-integer linear programming (MILP) model for the standard N-job, M-machine flowshop sequencing problem. Based on an earlier all-integer model developed ...