AdvOL Student Seminars and Defences
Michael Liut, March 28, 2019, 15:30-16:30, ITB 201
Speaker:   Michael Liut
Department of Computing and Software
McMaster University

Title:  Computing Lyndon Array
Read more...
 
AdvOL Optimization Seminars
Dalibor Froncek, March 28, 2019, 16:30-17:30, ITB 201
Speaker:   Dalibor Froncek
Department of Mathematics and Statistics
University of Minnesota Duluth

Title:  Magic type labelings of cycle products
Read more...
 
Fields Institute Industrial Optimization Seminar, March 19, 2019
Speakers:   Merve Bodur (University of Toronto)
Imre Polik (SAS Institute)

The Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home
Tuesday, 26 March 2019
 
 
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
 59 % Unknown
 15 % Commercial
 9 % networks
 5 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % Educational
 < 1.0 % 
 < 1.0 % Poland
 < 1.0 % Ukraine
 < 1.0 % United Kingdom
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % India
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % Organization
 < 1.0 % Australia

Visitors: 5943729
Antoine Deza, January 23, 2018, 16:30-17:30, ITB 201
Speaker:   Antoine Deza
Department of Computing and Software
McMaster University

Title:  On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs

We introduce a family of lattice polytopes, called primitive zonotopes, which can be seen as a generalization of the permutahedron. We discuss connections to the largest diameter of lattice polytopes and to the computational complexity of multicriteria matroid optimization. Tightening of the bounds for the largest possible diameter of a lattice polytope, complexity results, and open questions are presented. In particular, we answer a question raised in 1986 by Colbourn, Kocay, and Stinson by showing that deciding whether a given sequence is the degree sequence of a 3-hypergraph is computationally prohibitive. Based on joint works with Asaf Levin (Technion), George Manoussakis (Paris Sud), Syed Meesum (IMSc Chennai), Shmuel Onn (Technion), and Lionel Pounin (Paris XIII).
 
< 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!