|
Abstract |
We start this presentation with an interesting example of a small global optimization problem. After that we present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles (whose traveling salesman problem), optimum elementary paths even in a graph with negative cycles, and optimum trees (whose Steiner tree problem) problems. Computational results are presented. |
