Elsevier

Information Processing Letters

Volume 93, Issue 4, 28 February 2005, Pages 173-175
Information Processing Letters

UPS-k: a set partitioning problem with applications in UPS pickup-delivery system

https://doi.org/10.1016/j.ipl.2004.10.010Get rights and content

First page preview

First page preview
Click to open first page preview

References (4)

  • C.G. Fernandes et al.

    The UPS problem

  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-completeness

    (1979)
There are more references available in the full text version of this article.

Cited by (0)

View full text