scientific article; zbMATH DE number 5173844
From MaRDI portal
Publication:5294075
zbMath1118.90008MaRDI QIDQ5294075
Balabhaskar Balasundaram, Sergiy I. Butenko
Publication date: 23 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (14)
A review on algorithms for maximum clique problems ⋮ The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures ⋮ Spanning trees with a constraint on the number of leaves. A new formulation ⋮ A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem ⋮ On atomic cliques in temporal graphs ⋮ Topology design for on-demand dual-path routing in wireless networks ⋮ A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ Analysis of self-equilibrated networks through cellular modelling ⋮ Reformulations and solution algorithms for the maximum leaf spanning tree problem ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
Uses Software
This page was built for publication:
