✦ LIBER ✦

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

✍ Scribed by F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 301 KB
Volume: 55
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20310

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

A branch and cut algorithm for the Stein

A branch and cut algorithm for the Steiner problem in graphs

✍ Lucena, A.; Beasley, J. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

The two-edge connected hop-constrained n

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

✍ David Huygens; Martine Labbé; A. Ridha Mahjoub; Pierre Pesneau 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract This article deals with the Two‐edge connected Hop‐constrained Network Design Problem (or THNDP for short). Given a weighted graph __G__ = (__N__,__E__), an integer __L__ ≥ 2, and a subset of pairs of nodes __D__, the problem consists of finding the minimum cost subgraph in __G__ contai

A Better Approximation Ratio for the Min

A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem

✍ Cristina G Fernandes 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo

A branch-and-cut algorithm for the undir

A branch-and-cut algorithm for the undirected selective traveling salesman problem

✍ Gendreau, Michel; Laporte, Gilbert; Semet, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p