✦ LIBER ✦

A Note on the Complexity of a Simple Transportation Problem

✍ Scribed by Frederickson, Greg N.

Book ID: 118177290
Publisher: Society for Industrial and Applied Mathematics
Year: 1993
Tongue: English
Weight: 689 KB
Volume: 22
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0222005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on a stochastic production-maximi

A note on a stochastic production-maximizing transportation problem

✍ Uri Yechiali 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

A note on the complexity of the chromati

A note on the complexity of the chromatic number problem

✍ E.L. Lawler 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 285 KB

A note on the complexity of flow shop sc

A note on the complexity of flow shop scheduling with transportation constraints

✍ Jinjiang Yuan; Ameur Soukhal; Youjun Chen; Lingfa Lu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 168 KB

A note on a problem in the theory of gra

A note on a problem in the theory of grammatical complexity

✍ W. Bucher 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A Note on ‘The Transport Problem’

✍ R. Millward. 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB

The counting complexity of a simple sche

The counting complexity of a simple scheduling problem

✍ Gerardo Berbeglia 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the