✦ LIBER ✦

A branch-and-bound algorithm for the linear ordering problem with cumulative costs

✍ Scribed by Giovanni Righini

Book ID: 108118358
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 141 KB
Volume: 186
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.02.044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Median linear orders: Heuristics and a b

Median linear orders: Heuristics and a branch and bound algorithm

✍ J.P. Barthelemy; A. Guenoche; O. Hudry 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 901 KB

A branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 KB

A branch and bound algorithm for the tra

A branch and bound algorithm for the traveling purchaser problem

✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm

A branch and bound algorithm for the acy

A branch and bound algorithm for the acyclic subgraph problem

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A branch and bound algorithm for the max

A branch and bound algorithm for the maximum clique problem

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB

A branch and bound algorithm for the gen

A branch and bound algorithm for the generalized assignment problem

✍ G. Terry Ross; Richard M. Soland 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 578 KB