✦ LIBER ✦

A branch-and-bound algorithm for the minimum cut linear arrangement problem

✍ Scribed by Gintaras Palubeckis, Dalius Rubliauskas

Book ID: 118801991
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 693 KB
Volume: 24
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-011-9406-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for the minim

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem

✍ Diego Delle Donne; Javier Marenco 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 472 KB

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated minimum spanning tree problem

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

A branch and bound algorithm for the min

A branch and bound algorithm for the minimum storage-time sequencing problem

✍ P. Detti; D. Pacciarelli 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

A branch-and-cut algorithm for the resou

A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem

✍ Fischetti, Matteo; Vigo, Daniele 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.

A branch-and-bound algorithm for the lin

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

✍ Giovanni Righini 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A branch-and-cut algorithm for the Winne

A branch-and-cut algorithm for the Winner Determination Problem

✍ Laureano F. Escudero; Mercedes Landete; Alfredo Marín 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 616 KB