Pages that link to "Item:Q4427375"

The following pages link to Packet Routing in Telecommunication Networks with Path and Flow Restrictions (Q4427375):

Displaying 11 items.

• 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)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• An extended alternating direction method for variational inequality problems with linear equality and inequality constraints (Q879552) (← 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)
• New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
• A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints (Q2251725) (← links)
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
• Inexact decomposition methods for solving variational inequalities with linear equality constraint (Q2511020) (← links)
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)