Lexicographic local search and the p-center problem

Refael Hassin; Asaf Levin; Dana Morad

doi:10.1016/S0377-2217(02)00825-1

Lexicographic local search and the p-center problem

Refael Hassin, Asaf Levin^*, Dana Morad

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

We introduce a local search strategy that suits combinatorial optimization problems with a min-max (or max-min) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.

Original language	English
Pages (from-to)	265-279
Number of pages	15
Journal	European Journal of Operational Research
Volume	151
Issue number	2
DOIs	https://doi.org/10.1016/S0377-2217(02)00825-1
State	Published - 1 Dec 2003

Keywords

Facility planning
Heuristics

Access to Document

10.1016/S0377-2217(02)00825-1

Cite this

@article{60de9f43f0a84c82a4501d26a0f05066,

title = "Lexicographic local search and the p-center problem",

abstract = "We introduce a local search strategy that suits combinatorial optimization problems with a min-max (or max-min) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.",

keywords = "Facility planning, Heuristics",

author = "Refael Hassin and Asaf Levin and Dana Morad",

year = "2003",

month = dec,

day = "1",

doi = "10.1016/S0377-2217(02)00825-1",

language = "אנגלית",

volume = "151",

pages = "265--279",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Lexicographic local search and the p-center problem

AU - Hassin, Refael

AU - Levin, Asaf

AU - Morad, Dana

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We introduce a local search strategy that suits combinatorial optimization problems with a min-max (or max-min) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.

AB - We introduce a local search strategy that suits combinatorial optimization problems with a min-max (or max-min) objective. According to this approach, solutions are compared lexicographically rather then by their worst coordinate. We apply this approach to the p-center problem.

KW - Facility planning

KW - Heuristics

UR - http://www.scopus.com/inward/record.url?scp=0043023853&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(02)00825-1

DO - 10.1016/S0377-2217(02)00825-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0043023853

SN - 0377-2217

VL - 151

SP - 265

EP - 279

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

Lexicographic local search and the p-center problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this