Pages that link to "Item:Q1317166"
From MaRDI portal
The following pages link to Integer programming formulations of discrete hub location problems (Q1317166):
Displaying 50 items.
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- Hub location problems with price sensitive demands (Q264310) (← 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)
- Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach (Q319433) (← links)
- Hub location under competition (Q322435) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques (Q342143) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems (Q491079) (← links)
- Developing equilibrium optimization methods for hub location problems (Q521701) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- Hub location-allocation in intermodal logistic networks (Q531438) (← links)
- Location and allocation for distribution systems with transshipments and transportion economies of scale (Q689233) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
- Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
- Stochastic air freight hub location and flight routes planning (Q733484) (← links)
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
- Designing a hub location and pricing network in a competitive environment (Q781074) (← links)
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
- Airline flight frequency determination in response to competitive interactions using fuzzy logic (Q815483) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← 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)
- Aggregation in hub location problems (Q833529) (← links)
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem (Q833530) (← links)
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
- The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
- The \(p\)-hub center allocation problem (Q852943) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← 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)
- Routing traffic at hub facilities (Q972437) (← links)
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
