Lexicographic balanced optimization problems

Authors:
Abraham P. Punnen;Y. P. Aneja
Affiliations:
Department of Mathematical Sciences, University of New Brunswick, P.O. Box 5050, Saint John, NB, Canada;Faculty of Business Administration, University of Windsor, Windsor, Ont., Canada
Venue:
Operations Research Letters
Year:
2004

Citing 7
Cited 2

Most and least uniform spanning trees

Discrete Applied Mathematics
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
On finding most uniform spanning trees

Discrete Applied Mathematics
Minimum range balanced cuts via dynamic subset sums

Journal of Algorithms
Lexicographic bottleneck combinatorial problems

Operations Research Letters
An improved general procedure for lexicographic bottleneck problems

Operations Research Letters
Balanced optimization problems

Operations Research Letters

The balanced traveling salesmanproblem

Computers and Operations Research
On k-max-optimization

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.