✦ LIBER ✦

Approximation algorithms for combinatorial multicriteria optimization problems

✍ Scribed by Matthias Ehrgott

Book ID: 108481146
Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 235 KB
Volume: 7
Category: Article
ISSN: 0969-6016
DOI: 10.1016/s0969-6016(99)00024-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for combinatori

Approximation algorithms for combinatorial multicriteria optimization problems

✍ M. Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Metaheuristic algorithms for combinatori

Metaheuristic algorithms for combinatorial optimization problems

✍ Manuel Iori 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 41 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial fractional programming problems

✍ Satoru Hashizume; Masao Fukushima; Naoki Katoh; Toshihide Ibaraki 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 528 KB

Combinatorial Approximation Algorithms f

Combinatorial Approximation Algorithms for Generalized Flow Problems

✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

On metaheuristic algorithms for combinat

On metaheuristic algorithms for combinatorial optimization problems

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 2 views

Potential reduction algorithms for struc

Potential reduction algorithms for structured combinatorial optimization problems

✍ J.P. Warners; T. Terlaky; C. Roos; B. Jansen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 675 KB