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

Addressing the importance of the algorithm design process, Deterministic Operations Research focuses on the design of solution methods for both continuous and discrete linear optimization problems.

This paper presents an algorithm using sensitivity analysis to solve a linear twostage optimization problem. The underlying theory rests on a set of first order optimality conditions that parallel the ...

We give a branch-and-cut algorithm for solving linear programs (LPs) with continuous separable piecewise-linear cost functions (PLFs). Models for PLFs use continuous variables in special-ordered sets ...