Pages that link to "Item:Q4740330"

The following pages link to Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem (Q4740330):

Displayed 34 items.

• Models for planning capacity expansion in local access telecommunication networks (Q806810) ‎ (← links)
• Network flow models for the local access network expansion problem (Q856692) ‎ (← links)
• Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) ‎ (← links)
• A result on projection for the vehicle routing problem (Q1127162) ‎ (← links)
• Topological design of telecommunication networks --- local access design methods (Q1179728) ‎ (← links)
• Finding minimum cost directed trees with demands and capacities (Q1179742) ‎ (← links)
• Dynamic programming based heuristics for the topological design of local access networks (Q1179743) ‎ (← links)
• Configuration of fully replicated distributed database system over wide area networks (Q1197781) ‎ (← links)
• Topological design of wide area communication networks (Q1197802) ‎ (← links)
• Topological design of a centralized communication network with unreliable links and node outage costs (Q1333466) ‎ (← links)
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) ‎ (← links)
• Heuristic procedure neural networks for the CMST problem (Q1579025) ‎ (← links)
• Generalized spanning trees (Q1579496) ‎ (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) ‎ (← links)
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873) ‎ (← links)
• A multiperiod degree constrained minimal spanning tree problem (Q1848629) ‎ (← links)
• The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) ‎ (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) ‎ (← links)
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) ‎ (← links)
• A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) ‎ (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) ‎ (← links)
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. (Q2468608) ‎ (← links)
• Optimal buffer allocation in finite closed networks with multiple servers (Q2471231) ‎ (← links)
• Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) ‎ (← links)
• A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) ‎ (← links)
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) ‎ (← links)
• The Minimum Spanning Tree Problem with Time Window Constraints (Q3773692) ‎ (← links)
• Balanced spanning forests and trees (Q3984286) ‎ (← links)
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) ‎ (← links)
• Two Matching Based Algorithm for Tree Network Design (Q4297157) ‎ (← links)
• Topological Design of Centralized Computer Networks (Q4368605) ‎ (← links)
• (Q4944737) ‎ (← links)
• Exact solution of the centralized network design problem on directed graphs (Q5463666) ‎ (← links)
• Globally and locally minimal weight spanning tree networks (Q5949742) ‎ (← links)