Network cost minimization using threshold-based discounting
From MaRDI portal
Publication:1600844
DOI10.1016/S0377-2217(01)00151-5zbMath1008.90004OpenAlexW2047279742MaRDI QIDQ1600844
Darko Skorin-Kapov, Hrvoje Podnar, Jadranka Skorin-Kapov
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00151-5
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (15)
Hub location for time definite transportation ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Allocation strategies in hub networks ⋮ An alternative approach to address uncertainty in hub location ⋮ Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount ⋮ Network hub location problems: The state of the art ⋮ Threshold based discounting networks: the cost allocation provided by the nucleolus ⋮ Perspectives on modeling hub location problems ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ A competitive hub location and pricing problem
Uses Software
Cites Work
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Genetic algorithm for network cost minimization using threshold based discounting
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Airline network design and hub location problems
- Hub network games
This page was built for publication: Network cost minimization using threshold-based discounting
