Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
diasssembly optimation
Integer Programming
Cost saving approach using solution algorithms
1 15.053 Thursday, April 11 Some more applications of integer programming Cutting plane techniques for getting improved bounds Handouts: Lecture Notes.
Tight integrality gaps for vertex-cover semidefinite relaxations in the Lovász-Schrijver Hierarchy Avner Magen Joint work with Costis Georgiou, Toni Pitassi.
Computational Methods for Management and Economics Carla Gomes Module 2 (addendum) Revisiting the Divisibility Assumption (Textbook – Hillier and Lieberman)
Minimizing Average Flow-Time Naveen Garg IIT Delhi Joint work with Amit Kumar, Jivi Chadha,V Muralidhara, S. Anand.
Virtual Network Embedding with Coordinated Node and Link Mapping N. M. Mosharaf Kabir Chowdhury Muntasir Raihan Rahman and Raouf Boutaba University of.
The Traveling Salesman Problem in Theory & Practice Lecture 10: The Cutting Plane and Branch-and-Bound Approaches to TSP Optimization 1 April 2014 David.
CVPR2010: higher order models in computer vision: Part 4
ICCV2009: MAP Inference in Discrete Models: Part 6: Recent Advances in Convex Relaxations
