Pages that link to "Item:Q5939585"

The following pages link to A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585):

Displaying 20 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)
• 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)
• 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)
• The network design problem with relays (Q869627) (← links)
• A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← 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)
• Minimax flow tree problems (Q3057112) (← 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)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)