Pages that link to "Item:Q1600844"
From MaRDI portal
The following pages link to Network cost minimization using threshold-based discounting (Q1600844):
Displaying 15 items.
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Hub location for time definite transportation (Q833526) (← links)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount (Q1719220) (← links)
- Threshold based discounting networks: the cost allocation provided by the nucleolus (Q1779541) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- A competitive hub location and pricing problem (Q2356192) (← links)
- Network hub location problems: The state of the art (Q2482813) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- An alternative approach to address uncertainty in hub location (Q6176182) (← links)
