Minimum deviation and balanced optimization: A unified approach

Authors:
C. W. Duin;A. Volgenant
Affiliations:
Institute of Actuarial Science and Econometrics, Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Jodenbreestraat 23, 1011 NH Amsterdam, The Netherlands;Institute of Actuarial Science and Econometrics, Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Jodenbreestraat 23, 1011 NH Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
1991

Citing 4
Cited 3

Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications

Mathematical Programming: Series A and B
Balanced optimization problems

Operations Research Letters
An edge elimination test for the steiner problem in graphs

Operations Research Letters
Minimum deviation problems

Operations Research Letters

Load balancing in project assignment

Computers and Operations Research
The balanced traveling salesmanproblem

Computers and Operations Research
Quadratic bottleneck knapsack problems

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most combinatorial optimization problems have as criterion the sum of the weights in a solution, but sometimes the criterion is different. A Minimum Deviation Problem minimizes the difference between maximum and average weight in a solution. We introduce a general solution scheme that is also suited for balanced optimization, i.e., the problem to find a solution that has a minimal deviation between the largest and the smallest weight. The scheme has a forward and a backward version, that gives more flexibility to improve complexity results. We analyze the approach for spanning trees, paths and Steiner trees in graphs.