Sciweavers

16 search results - page 4 / 4
» Describing convex semialgebraic sets by linear matrix inequa...
Sort
View
4OR
2010
137views more  4OR 2010»
14 years 11 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...