✦ LIBER ✦

A note on the nestedness property for ordered median problems in tree networks

✍ Scribed by Huajun Tang

Book ID: 120796436
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2013
Tongue: English
Weight: 162 KB
Volume: 26
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-013-1283-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the subtree isomorphism for or

A note on the subtree isomorphism for ordered trees and related problems

✍ Roberto Grossi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 482 KB

An improved algorithm for the minmax reg

An improved algorithm for the minmax regret median problem on a tree

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

A polynomial method for the pos/neg weig

A polynomial method for the pos/neg weighted 3-median problem on a tree

✍ Rainer E. Burkard; Jafar Fathali 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 212 KB

A note on the “word-order problem” in ag

A note on the “word-order problem” in agrammatism

✍ David Caplan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A note on local spillovers, convexity, a

A note on local spillovers, convexity, and the strategic substitutes property in networks

✍ Pascal Billand, Christophe Bravard, Sudipta Sarangi 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 178 KB

A note on unbiased testing for the equiv

A note on unbiased testing for the equivalence problem — another christmas tree

✍ Axel Munk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 290 KB