1 / 2

Topics

Graphs and mathematical optimization. GMO. Graphs, networks, combinatorial optimization, mathematical programming, bilevel programming. Short presentation.

colman
Download Presentation

Topics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Graphs and mathematical optimization GMO Graphs, networks, combinatorial optimization, mathematical programming, bilevel programming Short presentation The group concentrates its research activities in the domain of mathematical optimization and more specially on the themes of combinatorial and network optimization and bilevel programming. Its main objective consists in developing new exact methods or improving existing ones, i.e. solving instances of larger size or in a faster way. To this end, the group relies on tools such as cutting planes, branch and cut, extended formulations, column generation. Topics • Network design, location, routing and pricing • Traffic engineering in IP networks • Haplotyping and phylogenies http://www.ulb.ac.be/di/gom/

  2. Graphs and mathematical optimization GMO European and international projects • Mathematical Programming Group (FRFC) • COMEX : Combinatorial Optimization: Metaheuristics and exact methods (IAP) Publications • D. Catanzaro, A. Godi and M. Labbé (2010). A class representative model for pure parsimony haplotyping. INFORMS journal on computing, 22(2), 195-209. • G. Heilporn, M. Labbé, P. Marcotte, and G. Savard (2011). Valid inequalities and Branch-and-Cut for the Clique Pricing Problem . Discrete Optimization 8, 393-410. • A. Altin, B. Fortz, H. Ümit (2012), Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2), 132-139. • B. Fortz, M. Labbé, F. Louveaux, and M. Poss, Stochastic binary problems with simple penalties for capacity constraints violations, Mathematical Programming, DOI 10.1007/s10107-012-0520-4. • Q. Botton, B. Fortz, L. Gouveia, and M. Poss, Benders Decomposition for the Hop-Constrained Survivable Network Design Problem, INFORMS journal on computing, DOI 10.1287/ijoc.1110.0472 Bernard Fortz (bfortz@ulb.ac.be) Martine Labbé (mlabbe@ulb.ac.be) http://www.ulb.ac.be/di/gom/

More Related