✦ LIBER ✦

Robust partial inverse network flow problems

✍ Scribed by Yang Xiaoguang

Book ID: 107500483
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2001
Tongue: English
Weight: 396 KB
Volume: 16
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-001-0026-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial algorithms for inverse net

Combinatorial algorithms for inverse network flow problems

✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

An inverse optimization problem is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 ʦ S. We want to perturb the cost vector c to d so that x 0 is an optimal solution of P with respect to the cost vector d, and wʈd

Partial inverse assignment problems unde

Partial inverse assignment problems under norm

✍ Xiaoguang Yang; Jianzhong Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Problems of network flow

✍ William Prager 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 302 KB

Robust estimation in inverse problems vi

Robust estimation in inverse problems via quantile coupling

✍ MaoZai Tian 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 211 KB

Inverse minimum flow problem

✍ Eleonor Ciurea; Adrian Deaconu 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 172 KB

Inverse Polymatroidal Flow Problem

✍ Mao-Cheng Cai; Xiaoguang Yang; Yanjun Li 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 70 KB