Pages that link to "Item:Q4228761"
From MaRDI portal
The following pages link to A dual algorithm for the uncapacitated hub location problem (Q4228761):
Displayed 25 items.
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- The \(p\)-hub center allocation problem (Q852943) (← links)
- An exact solution procedure for a cluster hub location problem (Q859914) (← links)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- A mixed-integer approach to Core-Edge design of storage area networks (Q878574) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
- A hybrid heuristic for the uncapacitated hub location problem (Q1609911) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Hub-and-spoke network design with congestion (Q1764770) (← links)
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Network hub location problems: The state of the art (Q2482813) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- HubLocator: An exact solution method for the multiple allocation hub location problem (Q5959392) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)