Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Satoru Fujishige"'
Autor:
Satoru Fujishige, Zaifu Yang
Publikováno v:
Journal of Mechanism and Institution Design, Vol 2, Iss 1, Pp 1-37 (2017)
We examine a spontaneous decentralized market process widely observed in real life labor markets. This is a natural random decentralized dynamic competitive process. We show that this process converges globally and almost surely to a competitive
Externí odkaz:
https://doaj.org/article/068564d688074bd8904738d800b61de2
Publikováno v:
Journal of Combinatorial Theory, Series B. 157:294-345
Autor:
Satoru Fujishige
It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::031f3da8453fb76301bbca63b62ff1cf
https://doi.org/10.1007/978-3-031-32726-1_11
https://doi.org/10.1007/978-3-031-32726-1_11
Autor:
Satoru Fujishige, F. Tardella
Publikováno v:
Mathematical Programming. 195:831-854
We focus on a new class of integrally convex functions which we call discrete 2-convex functions. Discrete 2-convexity generalizes known classes of integrally convex functions such as the well-established M-/M $${}^\natural $$ -convex and L-/L $${}^\
Publikováno v:
Journal of the Operations Research Society of Japan. 63:71-77
The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete Mathematics (2019)). For given two matroids on $E$, under the same ass
Autor:
Hiroshi Hirai, Satoru Fujishige
Publikováno v:
Journal of Combinatorial Theory, Series A. 185
Murota (1998) and Murota and Shioura (1999) introduced concepts of M-convex function and M♮-convex function as discrete convex functions, which are generalizations of valuated matroids due to Dress and Wenzel (1992). In the present paper we conside
Autor:
Satoru Fujishige
Publikováno v:
RAIRO - Operations Research. 53:1929-1935
The present note reveals the role of the concept of greedy system of linear inequalities played in connection with lexicographically optimal solutions on convex polyhedra and discrete convexity. The lexicographically optimal solutions on convex polyh
Autor:
Satoru Fujishige
Publikováno v:
Discrete Optimization. 33:140-145
Recently Dadush et al. (2017) have devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear progra