Constructing a DC decomposition for ordered median problems

Authors:
Zvi Drezner;Stefan Nickel
Affiliations:
Steven G. Mihaylo College of Business and Economics, California State University-Fullerton, Fullerton, USA 92834;Saarland University, Saarbrucken, Germany 66123 and Fraunhofer ITWM, Kaiserslautern, Germany
Venue:
Journal of Global Optimization
Year:
2009

Citing 4
Cited 1

DC programming: overview

Journal of Optimization Theory and Applications
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

Operations Research
A General Global Optimization Approach for Solving Location Problems in the Plane

Journal of Global Optimization
Algorithmic results for ordered median problems

Operations Research Letters

Voronoi diagrams with overlapping regions

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how to express ordered median problems as a difference between two convex functions (DC). Such an expression can be exploited in solving ordered median problems by using the special methodology available for DC optimization. The approach is demonstrated for solving ordered one median problems in the plane. Computational experiments demonstrated the effectiveness of the approach.