On combined minmax-minsum optimization

DOI10.1016/0305-0548(94)90084-1zbMath0810.90109OpenAlexW2062144253MaRDI QIDQ1333027

Abraham P. Punnen

Publication date: 13 September 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90084-1

zbMATH Keywords

combined minmax-minsum combinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (12)

Quadratic bottleneck knapsack problems ⋮ The balanced traveling salesman problem ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Constrained balanced optimization problems ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Multiple bottleneck assignment problem ⋮ An \(O(m\log n)\) algorithm for the max+sum spanning tree problem ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ The quadratic balanced optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time algorithm for the maximum capacity path problem
• Minimax linear programming problem
• Minimum deviation problems
• Minmax linear programmes with grouped variables
• On the solution of discrete bottleneck problems
• The Min-Max Spanning Tree Problem and some extensions
• The auction algorithm: A distributed relaxation method for the assignment problem
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Algorithms for the minimax transportation problem
• The Constrained Bottleneck Problem in Networks
• Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
• A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
• Parametric analysis of linear programs with upper bounded variables

This page was built for publication: On combined minmax-minsum optimization