Network cost minimization using threshold-based discounting
From MaRDI portal
Recommendations
- On cost allocation in networks with threshold based discounting
- Genetic algorithm for network cost minimization using threshold based discounting
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- scientific article; zbMATH DE number 1833125
- New formulation and relaxation to solve a concave-cost network flow problem
Cites work
- A quadratic integer program for the location of interacting hub facilities
- Airline network design and hub location problems
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Genetic algorithm for network cost minimization using threshold based discounting
- Heuristics for the p-hub location problem
- Hub network games
- Integer programming formulations of discrete hub location problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- On tabu search for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(17)- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- An exact algorithm for the modular hub location problem with single assignments
- Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount
- Genetic algorithm for network cost minimization using threshold based discounting
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- Perspectives on modeling hub location problems
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- A branch-and-cut algorithm for the hub location and routing problem
- Allocation strategies in hub networks
- scientific article; zbMATH DE number 1833125 (Why is no real title available?)
- Single allocation hub location with heterogeneous economies of scale
- An alternative approach to address uncertainty in hub location
- Hub location for time definite transportation
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
This page was built for publication: Network cost minimization using threshold-based discounting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600844)
