AdvOL Student Seminars and Defences
Xiao Jiao Wang, March 27, 2018, 15:30-16:00, ITB 201
Speaker:   Xiao Jiao Wang

Title:  On inventory allocation for periodic review assemble-to-order systems
 
AdvOL Optimization Seminars
Michael Metel, March 27, 2018, 16:30-17:30, ITB 201
Speaker:   Michael Metel
DeGroote School of Business
McMaster University

Title:  Electric car sharing charging station location optimization with limited vehicle relocation
Read more...
 
Fields Institute Industrial Optimization Seminar, April 30, 2018
Speakers:   Reza Samavi (McMaster University and Vector Institute for Artificial Intelligence)
Ragavan Thurairatnam and Hashiam Kadhim (DeepLearni.ng Toronto)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Jaroslav Nešetřil, November 20, 2014, 16:30-17:30, ITB 201
Sunday, 24 June 2018
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % Educational
 < 1.0 % United Kingdom
 < 1.0 % Poland
 < 1.0 % Ukraine
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % India
 < 1.0 % Japan
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5493510
Jaroslav Nešetřil, November 20, 2014, 16:30-17:30, ITB 201
Speaker:   Jaroslav Nešetřil
Department of Applied Mathematics
Charles University Prague

Title:  Sparse - dense dichotomy

What is a sparse graph or structure? We present a possible answer to this question in a form of Nowhere Dense versus Somewhere Dense dichotomy. This very robust dichotomy, which can be characterized in several different ways, generalizes many concrete problems and has consequences for several algorithms such as restricted coloring and model checking. The talk is based in part on the book Sparsity, Graphs, Structures, and Algorithms, Springer 2012, co-authored with Patrice Ossona de Mendez.
 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!