✦ LIBER ✦

A decision-theoretic approach to robust optimization in multivalued graphs

✍ Scribed by Patrice Perny; Olivier Spanjaard; Louis-Xavier Storme

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 679 KB
Volume: 147
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0073-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An intelligent decision theoretic approa

An intelligent decision theoretic approach to producibility optimization in conceptual design

✍ Lisa J. Burnell; John W. Priest; Karan Briggs 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 674 KB

A graph-theoretic approach to explicit n

A graph-theoretic approach to explicit nonlinear pipe network optimization

✍ Paul Boulos; Tom Altman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 897 KB

A Graph-Theoretic Approach to Sequent De

A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus

✍ Gerald Penn 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 320 KB

A graph theoretical approach to Möbius s

A graph theoretical approach to Möbius systems in organic chemistry

✍ Milan Randić; Howard E. Zimmerman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 743 KB

Approaches to optimal aquifer management

Approaches to optimal aquifer management and intelligent control in a multiresolutional decision support system

✍ Shlomo Orr; Alexander M. Meystel 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 484 KB

Optimal clustering in graphs with weight

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a para