Median linear orders: Heuristics and a branch and bound algorithm

J. P. Barthelemy; A. Guenoche; O. Hudry

doi:10.1016/0377-2217(89)90442-6

Median linear orders: Heuristics and a branch and bound algorithm

J. P. Barthelemy
, A. Guenoche
, O. Hudry

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

Abstract

After recalling some facts about the median linear orders problem, two heuristics are studied to solve it. Then, a branch and bound method is designed which computes all the solutions.

Original language	English
Pages (from-to)	313-325
Number of pages	13
Journal	European Journal of Operational Research
Volume	42
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(89)90442-6
Publication status	Published - 16 Oct 1989

Keywords

Optimization
heuristics
multicriteria decision aid
scheduling

Access to Document

10.1016/0377-2217(89)90442-6

Cite this

@article{a365193cec4b4c9099d68045e1f8e26b,

title = "Median linear orders: Heuristics and a branch and bound algorithm",

abstract = "After recalling some facts about the median linear orders problem, two heuristics are studied to solve it. Then, a branch and bound method is designed which computes all the solutions.",

keywords = "Optimization, heuristics, multicriteria decision aid, scheduling",

author = "Barthelemy, \{J. P.\} and A. Guenoche and O. Hudry",

year = "1989",

month = oct,

day = "16",

doi = "10.1016/0377-2217(89)90442-6",

language = "English",

volume = "42",

pages = "313--325",

journal = "European Journal of Operational Research",

issn = "0377-2217",

number = "3",

}

TY - JOUR

T1 - Median linear orders

T2 - Heuristics and a branch and bound algorithm

AU - Barthelemy, J. P.

AU - Guenoche, A.

AU - Hudry, O.

PY - 1989/10/16

Y1 - 1989/10/16

N2 - After recalling some facts about the median linear orders problem, two heuristics are studied to solve it. Then, a branch and bound method is designed which computes all the solutions.

AB - After recalling some facts about the median linear orders problem, two heuristics are studied to solve it. Then, a branch and bound method is designed which computes all the solutions.

KW - Optimization

KW - heuristics

KW - multicriteria decision aid

KW - scheduling

U2 - 10.1016/0377-2217(89)90442-6

DO - 10.1016/0377-2217(89)90442-6

M3 - Article

AN - SCOPUS:0024749324

SN - 0377-2217

VL - 42

SP - 313

EP - 325

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Median linear orders: Heuristics and a branch and bound algorithm

Abstract

Keywords

Access to Document

Fingerprint

Cite this