✦ LIBER ✦

A branch and bound algorithm for the acyclic subgraph problem

✍ Scribed by R. Kaas

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 612 KB
Volume: 8
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(81)90005-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Bounds for the Maximum Acyclic Sub

Tight Bounds for the Maximum Acyclic Subgraph Problem

✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph

A branch-and-cut algorithm for the k-edg

A branch-and-cut algorithm for the k-edge connected subgraph problem

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 1 views

A recursive branch and bound algorithm f

A recursive branch and bound algorithm for the multidimensional knapsack problem

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 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 bound algorithm for the mul

A branch and bound algorithm for the multiple depot vehicle scheduling problem

✍ G. Carpaneto; M. Dell'amico; M. Fischetti; P. Toth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 814 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