Minimum deviation and balanced optimization: A unified approach

DOI10.1016/0167-6377(91)90085-4zbMath0729.90072OpenAlexW2066586043MaRDI QIDQ806674

A. Volgenant, Cees W. Duin

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90085-4

zbMATH Keywords

pathsSteiner treesspanning treesbalanced optimizationminimum deviationbottleneck criteria

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Quadratic bottleneck knapsack problems, Assignment problems: a golden anniversary survey, Minimum dispersion 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, Quadratic bottleneck 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, An \(O(m\log n)\) algorithm for the max+sum spanning tree problem, A Survey on Multiple Objective Minimum Spanning Tree Problems, Some inverse optimization problems under the Hamming distance, The quadratic balanced optimization problem, Solving some lexicographic multi-objective combinatorial problems

Cites Work

• A note on two problems in connexion with graphs
• Balanced optimization problems
• Minimum deviation problems
• An edge elimination test for the Steiner problem in graphs
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• The Min-Max Spanning Tree Problem and some extensions
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item