AdvOL Student Seminars and Defences
Asma Paracha, December 12, 2017, 15:30-16:00, ITB 201
Speaker:   Asma Paracha

Title:  Lyndon factors and periodicities in strings
 
AdvOL Optimization Seminars
Alexander Rosa, December 12, 2017, 16:30-17:30, ITB 201
Speaker:   Alexander Rosa
Department of Mathematics & Statistics
McMaster University

Title:  Reaction graphs of combinatorial configurations
Read more...
 
Fields Institute Industrial Optimization Seminar, November 14, 2017
Speakers:   Christopher Swartz (McMaster University)
Jesus Flores-Carrillo (Praxair)

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 Henry Wolkowicz, November 19, 2013, 16:30-17:30, ITB 201
Friday, 24 November 2017
 
 
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 % Educational
 < 1.0 % Brazil
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5234456
Henry Wolkowicz, November 19, 2013, 16:30-17:30, ITB 201
Speaker:   Henry Wolkowicz
Department of Combinatorics and Optimization
Faculty of Mathematics
University of Waterloo

Title:  Relaxations of Graph Partitioning and Vertex Separator Problems using Continuous Optimization

Both the Graph Partitioning and Vertex Separator problems are hard discrete optimization problems. We look at several approximation techniques. This includes eigenvalue and projected eigenvalue techniques, quadratic programming techniques, and semidefinite programming (SDP). In particular, we show that the SDP relaxation is equivalent to and arises from the Lagrangian relaxation for a particular quadratically constrained quadratic model. Moreover, the bounds obtained by the SDP techniques are the best among the ones we compare.

Joint work with Ting Kei Pong, Hao Sun, and Ningchuan Wang.

 
< 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!