Pages that link to "Item:Q5892561"

The following pages link to Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561):

Displaying 43 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)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← 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)
• Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← links)
• A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
• Layered graphs: applications and algorithms (Q2287476) (← links)
• The two-level diameter constrained spanning tree problem (Q2340278) (← links)
• Design and dimensioning of hydrogen transmission pipeline networks (Q2355838) (← links)
• Characterizing acyclic graphs by labeling edges (Q2448884) (← links)
• Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
• A New Formulation for Spanning Trees (Q2840708) (← links)
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
• (Q4553286) (← links)
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
• Distance Transformation for Network Design Problems (Q5231681) (← links)
• An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
• Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
• Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← 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 (Q5891541) (← links)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
• Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)