BICRITERIA NETWORK FLOW PROBLEMS - CONTINUOUS CASE

被引：26

作者：

LEE, H

PULAT, PS

机构：

[1] School of Industrial Engineering, University of Oklahoma, Norman

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1991年 / 51卷 / 01期

关键词：

NETWORK; MULTIPLE CRITERIA; MATHEMATICAL PROGRAMMING;

D O I：

10.1016/0377-2217(91)90151-K

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

An algorithm for bicriteria network flow problems is developed. It deals with a broader class of minimum cost network flow problems which include transportation, maximum flow, assignment, shortest path, and transshipment problems rather than a specific one. The algorithm integrates bicriteria mathematical programming theory with the out-of-kilter method.

引用

页码：119 / 126

页数：8

共 16 条

[1] BICRITERIA TRANSPORTATION PROBLEM [J].