Sciweavers

985 search results - page 194 / 197
» Piercing Convex Sets
Sort
View
4OR
2010
137views more  4OR 2010»
13 years 7 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,...
ANOR
2008
69views more  ANOR 2008»
13 years 7 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
BMCBI
2008
153views more  BMCBI 2008»
13 years 7 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
CGF
2006
125views more  CGF 2006»
13 years 7 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels