Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
From MaRDI portal
Publication:4427340
DOI10.1287/ijoc.10.2.180zbMath1054.90622OpenAlexW2138913744MaRDI QIDQ4427340
Publication date: 16 December 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.10.2.180
Related Items
Routing of uncertain traffic demands, Extended formulations for the cardinality constrained subtree of a tree problem, Unnamed Item, Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, Modeling and solving the rooted distance-constrained minimum spanning tree problem, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, On the hop-constrained survivable network design problem with reliable edges, An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees, Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems, A hop constrained min-sum arborescence with outage costs, The rainbow Steiner tree problem, Extended formulation for hop constrained distribution network configuration problems, Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations, A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem, On solving bi-objective constrained minimum spanning tree problems, The travelling salesman problem with positional consistency constraints: an application to healthcare services, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Design of survivable networks with vulnerability constraints, Wildlife reserve design with connectivity and buffer requirements, The \(k\) edge-disjoint 3-hop-constrained paths polytope, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, On the directed hop-constrained shortest path problem, Network-Based Approximate Linear Programming for Discrete Optimization, A Lagrangean-based decomposition approach for the link constrained Steiner tree problem, A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems, Combined route capacity and route length models for unit demand vehicle routing problems, A complete characterization of jump inequalities for the hop-constrained shortest path problem, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, A note on hop-constrained walk polytopes., A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Minimax flow tree problems, Towards optimizing the deployment of optical access networks, Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints, Characterization of facets of the hop constrained chain polytope via dynamic programming, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, New formulations and solution procedures for the hop constrained network design problem., Differential approximation of NP-hard problems with equal size feasible solutions, A formulation for a hop constrained survivable network design problem, Hop-constrained node survivable network design: An application to MPLS over WDM, The maximum \(f\)-depth spanning tree problem
