Narrow search
Showing 1 - 9 of 9
Cover Image
A note on the serial dictatorship with project closures
Kamiyama, Naoyuki - In: Operations research letters 41 (2013) 5, pp. 559-561
Persistent link: https://www.econbiz.de/10010191945
Cover Image
Super-stable common independent sets of generalized matroids
Kamiyama, Naoyuki - In: Operations research letters : a journal of INFORMS … 60 (2025), pp. 1-4
Persistent link: https://www.econbiz.de/10015359133
Cover Image
Envy-free matchings with one-sided preferences and matroid constraints
Kamiyama, Naoyuki - In: Operations research letters 49 (2021) 5, pp. 790-794
Persistent link: https://www.econbiz.de/10013207449
Cover Image
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; … - In: Operations research letters 50 (2022) 3, pp. 370-375
Persistent link: https://www.econbiz.de/10013364110
Cover Image
Performance evaluation of cautious transaction schedulers
Kiniwa, Jun; Katoh, Naoki - 1993
Persistent link: https://www.econbiz.de/10000883772
Cover Image
On the total number of pivots required for certain parametric combinatorial optimization problems
Katoh, Naoki; Ibaraki, Toshihide - 1983
Persistent link: https://www.econbiz.de/10002186926
Cover Image
An efficient algorithm for K shortest simple paths
Katoh, Naoki; Ibaraki, Toshihide; Mine, Hisashi - 1981
Persistent link: https://www.econbiz.de/10003113852
Cover Image
A rooted-forest partition with uniform vertex demand
Katoh, Naoki; Tanigawa, Shin-ichi - In: Journal of combinatorial optimization 24 (2012) 2, pp. 67-98
Persistent link: https://www.econbiz.de/10009574011
Cover Image
A population-based algorithm for solving linear assignment problems with two objectives
Gandibleux, Xavier; Morita, Hiroyuki; Katoh, Naoki - In: Computers & operations research : and their … 79 (2017), pp. 291-303
Persistent link: https://www.econbiz.de/10011673537