Talk by Nelson Maculan: «Combinatorial optimization models with a polynomial number of variables and constraints for some problems in graphs»
Speaker:
Nelson Maculan (Federal University of Rio de Janeiro)
Location:
Room P. Flajolet, Alan Turing Building
Date:
Tue, 25 Apr 2017, 15:00-16:00
Abstract: 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. Mots clefs : modeling combinatorial optimization problems, optimization in graphs, characterization of connected subgraphs.