Pages that link to "Item:Q1887911"

The following pages link to Locating median cycles in networks (Q1887911):

Displaying 33 items.

• Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Geometric fit of a point set by generalized circles (Q652655) (← links)
• Locating a general minisum `circle' on the plane (Q766255) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A location-routing problem in glass recycling (Q2259043) (← links)
• Location of speed-up subnetworks (Q2259045) (← links)
• Fitting concentric circles to measurements (Q2441575) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Distribution network design on the battlefield (Q3168957) (← links)
• Mathematical models for the variable weights version of the inverse minimax circle location problem (Q5855728) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)