Design of survivable networks: A survey
H Kerivin, AR Mahjoub - Networks: An International Journal, 2005 - Wiley Online Library
For the past few decades, combinatorial optimization techniques have been shown to be
powerful tools for formulating and solving optimization problems arising from practical …
powerful tools for formulating and solving optimization problems arising from practical …
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem
arising in the design of centralized telecommunication networks with quality of service …
arising in the design of centralized telecommunication networks with quality of service …
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
L Gouveia - INFORMS Journal on Computing, 1998 - pubsonline.informs.org
We use variable redefinition (see R. Martin, 1987. Generating Alternative Mixed-Integer
Programming Models Using Variable Redefinition, Operations Research 35, 820–831) to …
Programming Models Using Variable Redefinition, Operations Research 35, 820–831) to …
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
GR Raidl, BA Julstrom - Proceedings of the 2003 ACM symposium on …, 2003 - dl.acm.org
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter
minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no …
minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no …
On formulations and methods for the hop-constrained minimum spanning tree problem
In this chapter we present a general framework for modeling the hopconstrained minimum
spanning tree problem (HMST) which includes formulations already presented in the …
spanning tree problem (HMST) which includes formulations already presented in the …
A new lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree
problem (HMST). The HMST is NP-hard and models the design of centralized …
problem (HMST). The HMST is NP-hard and models the design of centralized …
Two edge-disjoint hop-constrained paths and polyhedra
D Huygens, AR Mahjoub, P Pesneau - SIAM Journal on Discrete Mathematics, 2004 - SIAM
Given a graph G with distinguished nodes s and t, a cost on each edge of G, and a fixed
integer L ≧ 2, the two edge-disjoint hop-constrained paths problem is to find a minimum …
integer L ≧ 2, the two edge-disjoint hop-constrained paths problem is to find a minimum …
The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut
D Huygens, M Labbé, AR Mahjoub… - Networks: An …, 2007 - Wiley Online Library
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 …
(or THNDP for short). Given a weighted graph G=(N, E), an integer L≥ 2, and a subset of …
An algorithm to generate all spanning trees of a graph in order of increasing cost
K Sörensen, GK Janssens - Pesquisa Operacional, 2005 - SciELO Brasil
A minimum spanning tree of an undirected graph can be easily obtained using classical
algorithms by Prim or Kruskal. A number of algorithms have been proposed to enumerate all …
algorithms by Prim or Kruskal. A number of algorithms have been proposed to enumerate all …
Greedy heuristics for the bounded diameter minimum spanning tree problem
BA Julstrom - Journal of Experimental Algorithmics (JEA), 2010 - dl.acm.org
Given a connected, weighted, undirected graph G and a bound D, the bounded diameter
minimum spanning tree problem seeks a spanning tree on G of minimum weight among the …
minimum spanning tree problem seeks a spanning tree on G of minimum weight among the …