𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial time algorithm for a chance-constrained single machine scheduling problem

✍ Scribed by Naoki Katoh; Toshihide Ibaraki

Book ID
107917059
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
280 KB
Volume
2
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomial time approximation algorithms
Polynomial time approximation algorithms for machine scheduling: ten open problems
✍ Petra Schuurman; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 91 KB πŸ‘ 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. Β© 2001 John Wiley & Sons, Inc.