( en | de | ru )

 

Disambiguation of "Inuiguchi, Masahiro"

Author of the publication

copydeleteadd this publication to your clipboard
Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function.

, and . Ann. Oper. Res., 256 (2): 285-304 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Masahiro Noguchi

Masahiro Ogawa

Masahiro Yoshida

Masahiro Katsura

Masahiro Niitsuma

 

Other publications of authors with the same name

An Evidence Theoretic Approach to Interval Analytic Hierarchy Process.. IUKM, volume 10758 of Lecture Notes in Computer Science, page 60-71. Springer, (2018)Interpretation of Variable Consistency Dominance-Based Rough Set Approach by Minimization of Asymmetric Loss Function., , , and . IUKM, volume 11471 of Lecture Notes in Computer Science, page 135-145. Springer, (2019)An Ensemble Learning Approach Based on Rough Set Preserving the Qualities of Approximations., , , , and . IUKM, volume 9376 of Lecture Notes in Computer Science, page 247-253. Springer, (2015)Logarithmic Conversion Approach to the Estimation of Interval Priority Weights from a Pairwise Comparison Matrix., and . IUKM, volume 9376 of Lecture Notes in Computer Science, page 77-88. Springer, (2015)Possibilistic Linear Programming With Globally Interactive Fuzzy Numbers., and . FUZZ-IEEE, page 1215-1218. IEEE, (2001)Bilevel linear programming with lower-level fuzzy objective function., and . IFSA-SCIS, page 1-6. IEEE, (2017)The contributions of K. Asai and H. Tanaka in fuzzy optimization., and . IFSA/NAFIPS, page 274-279. IEEE, (2013)A unified approach to reducts in dominance-based rough set approach., and . Soft Comput., 14 (5): 507-515 (2010)A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness., , and . CASE, page 875-880. IEEE, (2007)Decomposition of timed automata for solving scheduling problems., , and . SMC, page 2459-2464. IEEE, (2008)