Balanced optimization problems

Authors:
S Martello;W.R Pulleyblank;P Toth;D De Werra
Affiliations:
University of Bologna, Italy;University of Waterloo, Canada;University of Bologna, Italy;Federal Institute of Technology, Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
1984

Citing 0
Cited 10

Computer-supported negotiation of course content

Computers & Education
On a pair of job-machine assignment problems with two stages

Computers and Operations Research
On uniform k-partition problems

Discrete Applied Mathematics
Load balancing in project assignment

Computers and Operations Research
The balanced traveling salesmanproblem

Computers and Operations Research
An inverse model for the most uniform problem

Operations Research Letters
Minimum deviation and balanced optimization: A unified approach

Operations Research Letters
Lexicographic balanced optimization problems

Operations Research Letters
Minimum deviation problems

Operations Research Letters
k-Sum optimization problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose we are given a finite set E, a family F of 'feasible' subsets of E and a real weight c(e) associated with every e@eE. We consider the problem of finding S@eF for which max {c(e)-c(e'): e, e' @eS} is minimized. In other words, the differenc value between the largest and smallest value used should be as small as possible. We show that if we can efficiently answer the feasibility question then we can efficiently solve the optimization problem. We specialize these results to assignment problems and thereby obtain on O(n^4) algorithm for 'balanced' assignment problems.