Pages that link to "Item:Q4427340"
From MaRDI portal
The following pages link to Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints (Q4427340):
Displaying 46 items.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- A note on hop-constrained walk polytopes. (Q703241) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- Minimax flow tree problems (Q3057112) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem (Q4944737) (← links)
- A formulation for a hop constrained survivable network design problem (Q4987706) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
- The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)
- Wildlife reserve design with connectivity and buffer requirements (Q6195027) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
- A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)
