Sciweavers

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

31

JCO
2000

favoriteEmaildiscussreport

59views more JCO 2000»

Facets of an Assignment Problem with 0-1 Side Constraint

13 years 10 months ago

Facets of an Assignment Problem with 0-1 Side Constraint

Download deepblue.lib.umich.edu

We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0

Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty

Real-time Traffic

Bipartite Graph | Incomlpete Bipartite Graph | Incomplete Bipartite Graph | JCO 2000 |

claim paper

Related Content

» Approximability of Integer Programming with Generalised Constraints

» Approximability of Clausal Constraints

» Computational Complexity of Constraint Satisfaction

» Online Square Packing

» On Computing Pareto Stable Assignments

» Bilateral timescaling for control of task freedoms of a constrained nonholonomic system

» On Quadratic Threshold CSPs

» Optimal online assignment with forecasts

» On the complexity of schedule control problems for knockout tournaments

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCO
Authors	Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty

Comments (0)