About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Computers and Operations Research
Paper
New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems
Abstract
We present new relaxation algorithms for the uncapacitated continuous and discrete p-center problems. We have conducted an experimental study that demonstrated that these new algorithms are extremely efficient. © 2008 Elsevier Ltd. All rights reserved.