Pages that link to "Item:Q1342649"
From MaRDI portal
The following pages link to Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649):
Displayed 19 items.
- Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Stochastic air freight hub location and flight routes planning (Q733484) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- Location of hubs in a competitive environment (Q1296365) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- The hub location and routing problem (Q1388939) (← links)
- The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
- Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
- Hub-and-spoke network design with congestion (Q1764770) (← links)
- Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← links)
- Network hub location problems: The state of the art (Q2482813) (← links)
- Capacitated single allocation hub location problem-A bi-criteria approach (Q2483516) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
- Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) (← links)
- HubLocator: An exact solution method for the multiple allocation hub location problem (Q5959392) (← links)