Pages that link to "Item:Q1810478"

The following pages link to Generalized network design problems. (Q1810478):

Displaying 21 items.

• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
• An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
• On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
• The generalized fixed-charge network design problem (Q856677) (← links)
• A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
• The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• A meta-heuristic approach for solving the urban network design problem (Q1044149) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Computing optimal shortcuts for networks (Q2001454) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• On the minimum routing cost clustered tree problem (Q2359809) (← links)
• Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
• On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
• The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
• Generalized network design polyhedra (Q3100692) (← links)
• Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
• Application of Metaheuristics to Large-Scale Transportation Problems (Q5116364) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
• Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)