We present a method for approximating the solution of mixed integer nonconcave programming problems in bounded variables. We present computational results for 39 test problems which suggest that the ...

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

The linear program is formulated using judiciously chosen variables and constraints and we show a one-to-one correspondence between algorithms for the secretary problem and feasible solutions to the ...