Lexicographic balanced optimization problems

DOI10.1016/S0167-6377(03)00065-8zbMath1056.90122OpenAlexW2092671842MaRDI QIDQ1433654

Abraham P. Punnen, Yash P. Aneja

Publication date: 1 July 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00065-8

zbMATH Keywords

AlgorithmsComplexityGraphsBottleneck problemsBalanced optimizationLexicographic problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ On discrete optimization with ordering ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ The balanced traveling salesman problem ⋮ Task preference-based bottleneck assignment problem ⋮ On generalized balanced optimization problems ⋮ Generalized multiple objective bottleneck problems ⋮ On \(k\)-Max-optimization ⋮ The quadratic balanced optimization problem

Cites Work

• Unnamed Item
• Balanced optimization problems
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• On finding most uniform spanning trees
• Minimization of maximum absolute deviation in integers
• The Min-Max Spanning Tree Problem and some extensions
• An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
• The balanced linear programming problem
• An improved general procedure for lexicographic bottleneck problems
• Lexicographic bottleneck combinatorial problems
• An Algorithm for Minimizing the Range of Lateness on a Single Machine
• Lexicographical problems of linear programming
• Minimizing the Range of Lateness on a Single Machine
• Minimum Range Balanced Cuts via Dynamic Subset Sums