Median linear orders: Heuristics and a branch and bound algorithm

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 1989-10, Vol.42 (3), p.313-325
Hauptverfasser:	Barthelemy, J.P., Guenoche, A., Hudry, O.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Decision theory. Utility theory Exact sciences and technology Heuristic heuristics Mathematical models multicriteria decision aid Operational research and scientific management Operational research. Management science Operations research Optimization Scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0377-2217 1872-6860
DOI:	10.1016/0377-2217(89)90442-6