Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

JCO
2000

favoriteEmaildiscussreport

39views more JCO 2000»

On Some Polyhedra Covering Problems

13 years 10 months ago

On Some Polyhedra Covering Problems

Download www.iapmm.lviv.ua

Cao An Wang, Bo-Ting Yang, Binhai Zhu

Real-time Traffic

JCO 2000 |

claim paper

Related Content

» Twophase greedy algorithms for some classes of combinatorial linear programs

» Algorithms for twobox covering

» Cutting plane algorithms for 01 programming based on cardinality cuts

» Cover and Pack Inequalities for Mixed Integer Programming

» What makes some POMDP problems easy to approximate

» The Windy General Routing Polyhedron A Global View of Many Known Arc Routing Polyhedra

» Restricted Strip Covering and the Sensor Cover Problem

» Finding Compact Coordinate Representations for Polygons and Polyhedra

» Scanning Polyhedra without Doloops

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCO
Authors	Cao An Wang, Bo-Ting Yang, Binhai Zhu

Comments (0)