Pages that link to "Item:Q1919978"

The following pages link to Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978):

Displaying 46 items.

• Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← 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)
• Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843) (← 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)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
• A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
• Designing reliable tree networks with two cable technologies (Q1291775) (← links)
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• Clustering data that are graph connected (Q1753555) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
• A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
• Reducing the diameter of a unit disk graph via node addition (Q2353655) (← 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)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• A new rule for source connection problems (Q2514781) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Network design for time‐constrained delivery (Q5503760) (← links)
• On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← 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)
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints (Q5946820) (← links)
• The profit-oriented hub line location problem with elastic demand (Q6047874) (← links)
• Two dependency constrained spanning tree problems (Q6067892) (← links)
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)