Pages that link to "Item:Q3115932"

The following pages link to Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms (Q3115932):

Displaying 50 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach (Q319433) (← links)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• A Stackelberg hub arc location model for a competitive environment (Q337007) (← 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)
• Facility location models to locate data in information networks: a literature review (Q512996) (← links)
• A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
• The transfer point location problem (Q864017) (← links)
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
• On ``A quadratic integer program for the location of interacting hub facilities'' (Q915642) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A quadratic integer program for the location of interacting hub facilities (Q1092794) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making (Q1723340) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← 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)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Stochastic single-allocation hub location (Q2029287) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← 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)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Modeling congestion and service time in hub location problems (Q2295119) (← links)
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
• A competitive hub location and pricing problem (Q2356192) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• Capacitated single allocation hub location problem-A bi-criteria approach (Q2483516) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Hub Arc Location Problems: Part I—Introduction and Results (Q3115931) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• Hub Location Problems: The Location of Interacting Facilities (Q5506727) (← links)
• A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• Parcel Distribution Timetabling Problem with Incomplete Hub Network (Q6160431) (← links)