Pages that link to "Item:Q833521"

The following pages link to A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521):

Displaying 40 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
• A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• LTL logistics networks with differentiated services (Q1761236) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm (Q1792363) (← links)
• A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network (Q1793287) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• Multi-period hub set covering problems with flexible radius: a modified genetic solution (Q2289304) (← links)
• Design of a reliable logistics network with hub disruption under uncertainty (Q2290904) (← links)
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm (Q2295062) (← links)
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
• A single allocation hub location and pricing problem (Q2301040) (← links)
• A competitive hub location and pricing problem (Q2356192) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
• A leader-follower single allocation hub location problem under fixed markups (Q5866184) (← links)
• A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands (Q6087494) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
• Machine learning augmented approaches for hub location problems (Q6109558) (← links)
• Parcel Distribution Timetabling Problem with Incomplete Hub Network (Q6160431) (← links)
• Relay network design with direct shipment and multi-relay assignment (Q6179236) (← links)
• Hub location with congestion and time-sensitive demand (Q6565427) (← links)