Minimum-Cost Bounded-Degree Spanning Trees
bubeck_optimization
1 Matching Polytope x1 x2 x3 Lecture 12: Feb 22 x1 x2 x3.
Semi-Definite Algorithm for Max-CUT Ran Berenfeld May 10,2005.
Cooperative Weakest Link Games Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein & Morteza Zadimoghaddam CoopMAS 2013 St. Paul, Minnesota.
Strong Implementation of Social Choice Functions in Dominant Strategies Clemens ThielenSven O. Krumke 3rd International Workshop on Computational Social.
Identifying local structure in large networks Reid Andersen Joint work with Fan Chung and Lincoln Lu.
1 Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21.
1 IE 531 Linear Programming Spring 2015 Sungsoo Park.
Week 7 - Exact Solving Techniques
OR-1 2013 1 Chapter 1. Introduction Ex : Diet Problem Daily requirements : energy(2000kcal), protein(55g), calcium(800mg) Food Serving size Energy (kcal)
Cooperative Weakest Link Games
