Pages that link to "Item:Q1278374"

The following pages link to Multicommodity flow models for spanning trees with hop constraints (Q1278374):

Displaying 44 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
• A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
• Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← links)
• Designing reliable tree networks with two cable technologies (Q1291775) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• A multicommodity network flow application for the capacitated minimal spanning tree problem (Q1890671) (← links)
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
• A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
• Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees (Q2235240) (← links)
• On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
• The minimum cost hop-and-root constrained forest in wireless sensor networks (Q2840531) (← links)
• Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem (Q2840729) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• (Q5020877) (← links)
• Designing multi-commodity flow trees (Q5060134) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Distance Transformation for Network Design Problems (Q5231681) (← links)
• Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
• Network design for time‐constrained delivery (Q5503760) (← 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)
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
• Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)