ABSTRACT
Overview In this chapter we give a brief introduction to the theory of computational complexity. For a more extensive account on this subject we refer the reader to Schrijver (1998). We will successively examine Dantzig’s simplex algorithm from Chapter 3, the interior path algorithm from Chapter 6, and the branch-and-bound algorithm from Chapter 7.
