Pages that link to "Item:Q4732287"

The following pages link to Traveling Salesman Facility Location Problems (Q4732287):

Displaying 16 items.

• A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
• Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse (Q493248) (← links)
• Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• The transfer point location problem (Q864017) (← links)
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
• The probabilistic minimum dominating set problem (Q1686054) (← links)
• On the probabilistic min spanning tree problem (Q1935723) (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Distribution network design on the battlefield (Q3168957) (← links)
• Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands (Q5953168) (← links)
• The probabilistic uncapacitated open vehicle routing location problem (Q6179724) (← links)