This chapter is an introduction to inverse combinatorial optimization. Given an instance of a problem and a fixed feasible solution, the aim is to optimally (w.r.t. a given norm) modify the cost system of the instance (or its structure) to make this solution optimal. We first give the main known examples of polynomial inverse problems (essentially based on linear programming), then we give some complexity results in this area.no
