Median linear orders: Heuristics and a branch and bound algorithm

Median linear orders: Heuristics and a branch and bound algorithm

0.00 Avg rating0 Votes
Article ID: iaor1990277
Country: Netherlands
Volume: 42
Issue: 3
Start Page Number: 313
End Page Number: 325
Publication Date: Oct 1989
Journal: European Journal of Operational Research
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.