|
|||||
|
|
Lexicographic balanced optimization problems |
|
| Authors: | Abraham P Punnen YP Aneja |
| Institution: | a Department of Mathematical Sciences, University of New Brunswick, P.O. Box 5050, Saint John, NB, Canada b Faculty of Business Administration, University of Windsor, Windsor, Ont., Canada |
| Abstract: | We introduce the lexicographic balanced optimization problem (LBaOP) and show that it can be solved efficiently if an associated lexicographic bottleneck problem can be solved efficiently. For special cases of cuts in a graph and base system of a matroid, improved algorithms are proposed. A generalization of LBaOP is also discussed. |
| Keywords: | Balanced optimization Bottleneck problems Lexicographic problems Graphs Algorithms Complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |