{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:52Z","timestamp":1740028792740,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>In this work, we consider a risk-averse maximum weighted k-club problems. It is assumed that vertices of the graph have stochastic weights whose joint distribution is known. The goal is to find the k-club of minimum risk contained in the graph. A stochastic programming framework that is based on the formalism of coherent risk measures is used to find the corresponding subgraphs. The selected representation of risk of a subgraph ensures that the optimal solutions are maximal k-clubs. A combinatorial branch-and-bound solution algorithm is proposed and solution performances are compared with an equivalent mathematical programming counterpart problem for instances with k = 2.<\/jats:p>","DOI":"10.3233\/978-1-61499-391-9-231","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:11:46Z","timestamp":1739992306000},"source":"Crossref","is-referenced-by-count":0,"title":["On Risk-Averse Weighted k-Club Problems"],"prefix":"10.3233","author":[{"family":"Rysz Maciej","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Mahdavi Pajouh Foad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Krokhmal Pavlo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Pasiliao Eduardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["NATO Science for Peace and Security Series - D: Information and Communication Security","Examining Robustness and Vulnerability of Networked Systems"],"original-title":[],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:25:10Z","timestamp":1739993110000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=1874-6268&volume=37&spage=231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-391-9-231","relation":{},"ISSN":["1874-6268"],"issn-type":[{"value":"1874-6268","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}