最短距離データ包絡分...

最短距離データ包絡分析法について : 新MIP計算アプローチの提案 (小特集 経営工学の研究に携わる若手研究者)

Icons representing 記事

最短距離データ包絡分析法について : 新MIP計算アプローチの提案

(小特集 経営工学の研究に携わる若手研究者)

Call No. (NDL)
Z4-1257
Bibliographic ID of National Diet Library
030565727
Material type
記事
Author
王 緒
Publisher
東京 : 日本経営工学会
Publication date
2020-07
Material Format
Paper
Journal name
経営システム = Communications of Japan Industrial Management Association 30(1):2020.7
Publication Page
p.73-78
View All

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type
記事
Author/Editor
王 緒
Author Heading
Alternative Title
The Least Distance Problem in Data Envelopment Analysis
Periodical title
経営システム = Communications of Japan Industrial Management Association
No. or year of volume/issue
30(1):2020.7
Volume
30
Issue
1