✦ LIBER ✦

A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

✍ Scribed by Rashid Farooq

Publisher: Japan Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 936 KB
Volume: 25
Category: Article
ISSN: 0916-7005
DOI: 10.1007/bf03167514

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangean relaxation for a lower bound

Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms

✍ Ruy Eduardo Campello; Nelson F. Maculan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 925 KB

A polynomial algorithm for an open shop

A polynomial algorithm for an open shop problem with unit processing times and tree constraints

✍ H. Bräsel; D. Kluge; F. Werner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 619 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w