Pages that link to "Item:Q4346344"

The following pages link to Hub Location and the <i>p</i>-Hub Median Problem (Q4346344):

Displaying 50 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• A multi-objective model for locating search and rescue boats (Q323331) (← links)
• A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
• Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Graph clustering (Q458448) (← links)
• Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems (Q491079) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
• A clustering approach to the planar hub location problem (Q689257) (← links)
• Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• A novel scale-invariant, dynamic method for hierarchical clustering of data affected by measurement uncertainty (Q724539) (← links)
• Stochastic air freight hub location and flight routes planning (Q733484) (← links)
• Heuristics for the p-hub location problem (Q803033) (← links)
• Airline flight frequency determination in response to competitive interactions using fuzzy logic (Q815483) (← links)
• New complexity results for the \(p\)-hub median problem (Q829182) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• Aggregation in hub location problems (Q833529) (← links)
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
• The \(p\)-hub center allocation problem (Q852943) (← links)
• A distribution map for the one-median location problem on a network (Q864046) (← links)
• On ``A quadratic integer program for the location of interacting hub facilities'' (Q915642) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• Path relinking approach for multiple allocation hub maximal covering problem (Q971739) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A quadratic integer program for the location of interacting hub facilities (Q1092794) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← links)
• The hub location and routing problem (Q1388939) (← links)
• Location models for airline hubs behaving as \(M/D/c\) queues. (Q1423443) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• On the single-assignment \(p\)-hub center problem (Q1582051) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• A hybrid heuristic for the uncapacitated hub location problem (Q1609911) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)