Minimum deviation and balanced optimization: A unified approach

DOI10.1016/0167-6377(91)90085-4zbMATH Open0729.90072OpenAlexW2066586043MaRDI QIDQ806674FDOQ806674

Authors: A. Volgenant, Cees 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

Recommendations

• The balanced minimum evolution problem under uncertain data
• On generalized balanced optimization problems
• Min-max formulation of the balance number in multiobjective global optimization.
• Balanced optimization problems
• Unified minimax methods
• On min-norm and min-max methods of multi-objective optimization
• Optimization with some uncontrollable variables: a min-equilibrium approach
• scientific article; zbMATH DE number 5618680
• Balanced Optimization with Vector Costs

zbMATH Keywords

spanning treespathsSteiner treesbalanced optimizationminimum deviationbottleneck criteria

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Minimum dispersion problems
• Assignment problems: a golden anniversary survey
• Quadratic bottleneck problems
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
• Quadratic bottleneck knapsack problems
• The balanced traveling salesman problem
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
• The Deviation Constraint
• An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
• On the generality of the greedy algorithm for solving matroid base problems
• Constrained balanced optimization problems
• Title not available (Why is that?)
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Some inverse optimization problems under the Hamming distance
• Solving some lexicographic multi-objective combinatorial problems
• The quadratic balanced optimization problem
• Minimum deviation problems

This page was built for publication: Minimum deviation and balanced optimization: A unified approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806674)