Network reinforcement

DOI10.1007/S10107-005-0648-6MaRDI QIDQ2583121zbMATH OpenOpenAlexFDO

Authors Francisco Barahona

Publication date 13 January 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-005-0648-6

zbMATH Keywords

Network reinforcementSpanning trees

Mathematics Subject Classification ID

Trees (05C05) Deterministic network models in operations research (90B10)

Recommendations

• Network cohesion
• Computational Science - ICCS 2004
• Network Resilience
• Network resilience
• On Network Augmentation
• Networks and stability
• Networks

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• A faster algorithm for computing the strength of a network
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A new approach to the maximum-flow problem
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Computing the Strength of a Graph
• Connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Improved Algorithms for Bipartite Network Flow
• Minimum cuts, modular functions, and matroid polyhedra
• New primal and dual matching heuristics
• On the Problem of Decomposing a Graph into n Connected Factors
• Optimal attack and reinforcement of a network
• Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states
• Selected Applications of Minimum Cuts in Networks
• Separating from the dominant of the spanning tree polytope
• Separation of partition inequalities
• Trees and Cuts

Cited in

(9)

• A new algorithm for the intersection of a line with the independent set polytope of a matroid
• Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
• On some algorithmic aspects of hypergraphic matroids
• Graphic submodular function minimization: a graphic approach and applications
• A linear programming approach to increasing the weight of all minimum spanning trees
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Optimal attack and reinforcement of a network
• scientific article; zbMATH DE number 2080194 (Why is no real title available?)
• Mixed-integer models for complete-linkage clustering

This page was built for publication: Network reinforcement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583121)