Read more
This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems. Several exact and heuristic approaches are developed in this book in order to solve the DOMP.
Audience: The book is suitable for researchers in location theory, and graduate students in combinatorial optimization.
Summary
This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems.
Additional text
From the reviews:
"The book contains more than 200 pages and 75 references. It is very well written and structured and, in particular, the extensive computational results and the numerous examples provide an excellent insight into the Discrete Ordered Median Problem." (Stefan Nickel, Zentralblatt MATH, Vol. 1042, 2004)
"This book is excellent for researchers specialized in location theory and it is a great example for graduate students (especially in combinatorial optimization) to see how a well-thought, well-written dissertation looks like." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 70, 2004)
Report
From the reviews:
"The book contains more than 200 pages and 75 references. It is very well written and structured and, in particular, the extensive computational results and the numerous examples provide an excellent insight into the Discrete Ordered Median Problem." (Stefan Nickel, Zentralblatt MATH, Vol. 1042, 2004)
"This book is excellent for researchers specialized in location theory and it is a great example for graduate students (especially in combinatorial optimization) to see how a well-thought, well-written dissertation looks like." (Peter Hajnal, Acta Scientiarum Mathematicarum, Vol. 70, 2004)
