Algorithms and time complexity of the request-service problem
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2008/12/31
-
Indian UGC (journal)
-
Refrences11
-
Chunmei Liu
-
Legand Burge
-
Ajoni Blake
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
- An algorithmic framework for convex mixed integer nonlinear programs
- Bike sharing systems: Solving the static rebalancing problem
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
- An algorithm for drawing general undirected graphs
- An efficient algorith for determining the convex hull of a finite planar set
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A Comparison of Populations Served by Kidney Paired Donation and List Paired Donation | American Journal of Transplantation |
| 63 | 2005 |
| 10.1056/NEJMp038228 | 2004 | |||
The Hungarian method for the assignment problem | Naval Research Logistics Quarterly | 4,160 | 1955 | |
| Segev DL, Gentry SE, Warren DS, Reeb B, Montgomery RA (2005) Kidney paired donation and optimizing the use of live donor organs. J AMA 293(15):1883–1890 | 2005 | |||
| Computational complexity | 1994 |