Conference Program.
All sessions will be held at "Salon de Honor" located in USM main Building (Marked A in the map under Local Information). Lunches will take place at "Patio de los Cañones" (The yard behind buiding F).
|
Sunday, March 17th: 19:00-20:00 Registration and welcome reception at Hotel San Martín. |
| Time | Monday, March 18th | Tuesday, March 19th | Wednesday, March 20th |
|---|---|---|---|
09h00- 09h30 |
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza and Roland Grappe. Reverse Chvátal-Gomory rank. |
Bertrand Guenin and Leanne Stuive. Single commodity-flow algorithms for lifts of graphic and co-graphic matroids. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi and
Andreas Wiese. Constant Integrality Gap LP formulations of Unsplittable Flow on a Path. |
09h30- 10h00 |
Thomas Rothvoss and Laura Sanità. 0/1 Polytopes with Quadratic Chvatal Rank. |
Takasu Soma. Fast Deterministic Algorithms for Matrix Completion Problems |
Thomas Rothvoss. A simpler proof for O(congestion + dilation) packet routing. |
10h00- 10h30 |
Kent Andersen and Anders Jensen. Intersection Cuts for Mixed Integer Conic Quadratic Sets. |
Karen Aardal and Frederik von Heymann. On the Structure of Reduced Kernel Lattice Bases. |
David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee
and K.K. Ramakrishnan. Content placement via the exponential potential function method. |
10h30- 11h00 |
Coffee break | ||
11h00- 11h30 |
Hongbo Dong and Jeff Linderoth. On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators |
Viswanath Nagarajan, Hadas Shachnai and Baruch Schieber. The Euclidean k-Supplier Problem. |
Alberto Caprara, Margarida Carvalho, Andrea Lodi and Gerhard Woeginger. A complexity and approximability study of the bilevel knapsack problem. |
11h30- 12h00 |
Diego Moran and Santanu Dey. A Polynomial-time Algorithm to Check Closedness of Simple Second Order Mixed-integer Sets. |
Michael Dinitz and Anupam Gupta. Packing Interdiction and Partial Covering Problems. |
Tim Nonner and Maxim Sviridenko. An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem |
12h00-
12h30
|
Vishnu Narayanan. Facial Structure and Representation of Integer Hulls of Convex Sets. |
Danny Chen, Jian Li, Hongyu Liang and Haitao Wang. Matroid and Knapsack Center Problems. |
Ruben Hoeksma and Marc Uetz. Two Dimensional Optimal Mechanism Design for a Sequencing Problem. |
12h30-
14h00 |
Lunch | ||
14h00- 14h30 |
Benjamin Moseley, Kirk Pruhs and Cliff Stein. The Complexity of Scheduling for p-norms of Flow and Stretch. |
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels and Gautier Stauffer. Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property. |
Andras Sebo. Eight-Fifth Approximation for TSP Paths. |
14h30- 15h00 |
Maxim Sviridenko and Andreas Wiese. Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. |
Attila Bernáth and Gyula Pap. Blocking optimal arborescences. |
Zachary Friggstad, Anupam Gupta and Mohit Singh. An Improved Integrality Gap for Asymmetric TSP Paths. |
15h00- 15h30 |
Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch
Schieber, Roy Schwartz, Hadas Shachnai and Tami Tamir. All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. |
Stephan Held and Daniel Rotter. Shallow-Light Steiner Arborescences with Vertex Delays. |
Neil Olver and Rico Zenklusen. Chain-Constrained Spanning Trees. |
15h30- 16h00 |
Coffee break | ||
16h00- 16h30 |
Patrick Jaillet, José Soto and Rico Zenklusen. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. |
Amitabh Basu, Robert Hildebrand and Matthias Koeppe. Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case |
16h00: Bus to the airport. |
16h30- 17h00 |
Anupam Gupta and Viswanath Nagarajan. A Stochastic Probing Problem with Applications. |
Sanjeeb Dash, Oktay Gunluk and Diego Alejandro Moran Ramirez. On some generalizations of the split closure. |
|
17h00- 17h30 |
Anupam Gupta, Viswanath Nagarajan and Vijay Vazirani. Thrifty Algorithms for Multistage Robust Optimization. |
Michele Conforti, Gerard Cornuejols, Aris Daniilidis, Claude
Lemarechal and Jerome Malick. Cut-generating functions |
|
18h00- 19h30 |
Poster Session with Cheese & Wine | ||
19h30 |
Conference Dinner at "Restaurante Tierra de Fuego" | ||
