Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Laura Sanità"'
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd0ae2f3adf5a47df800b733000cdab9
https://doi.org/10.1007/978-3-031-32726-1_12
https://doi.org/10.1007/978-3-031-32726-1_12
Many network design problems deal with the design of low-cost networks that are resilient to the failure of their elements (such as nodes or links). One such problem is Connectivity Augmentation, with the goal of cheaply increasing the (edge- or node
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::511f379bfd033308a5efd710c968eb2c
https://hdl.handle.net/11565/4053396
https://hdl.handle.net/11565/4053396
Autor:
Laura Sanità, Zhuan Khye Koh
Publikováno v:
Mathematics of Operations Research, 45(4), 1318-1341. INFORMS Institute for Operations Research and the Management Sciences
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network barga
Autor:
Zhuan Khye Koh, Laura Sanità
Publikováno v:
Mathematical Programming, 183(1-2), 359-377. Springer
Mathematical Programming
Mathematical Programming
Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that as
Publikováno v:
Mathematics of Operations Research. 43:428-459
Let E be a finite set of elements, and let L be a clutter over ground set E. We say distinct elements e, f are opposite if every member and every minimal cover of L contains at most one of e, f. In this paper, we investigate opposite elements and rev
Autor:
Karen Aardal, Laura Sanità
This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully review
Publikováno v:
Mathematical Programming. 172:249-275
Cooperative matching games (Shapley and Shubik) and Network bargaining games (Kleinberg and Tardos) are games described by an undirected graph, where the vertices represent players. An important role in such games is played by stable graphs, that are
Autor:
Thomas Rothvoß, Laura Sanità
Publikováno v:
Operations Research. 65:212-220
For a polytope P, the Chvátal closure P′ ⊆ P is obtained by simultaneously strengthening all feasible inequalities cx ⩽ β (with integral c) to cx ⩽ ⌊β⌋. The number of iterations of this procedure that are needed until the integral hull
Autor:
Zhuan Khye Koh, Laura Sanità
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
IPCO
Cooperative games are an important class of problems in game theory, where the goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::014e524850d0b7f936bad61063f07479
https://doi.org/10.1007/978-3-030-17953-3_21
https://doi.org/10.1007/978-3-030-17953-3_21
Publikováno v:
SIAM Journal on Discrete Mathematics. 30:141-153
In the directed Steiner tree problem, we are given a digraph, nonnegative arc weights, a subset of vertices called terminals, and a special terminal called the root. The goal is to compute a minimum weight directed tree that connects each terminal to