Network cost minimization using threshold-based discounting
DOI10.1016/S0377-2217(01)00151-5zbMATH Open1008.90004OpenAlexW2047279742MaRDI QIDQ1600844FDOQ1600844
Authors: Hrvoje Podnar, Jadranka Skorin-Kapov, Darko 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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cites Work
- 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
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- On tabu search for the location of interacting hub facilities
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Airline network design and hub location problems
- Heuristics for the p-hub location problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Genetic algorithm for network cost minimization using threshold based discounting
- Hub network games
Cited In (17)
- Allocation strategies in hub networks
- 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
- Title not available (Why is that?)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- An exact algorithm for the modular hub location problem with single assignments
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- A branch-and-cut algorithm for the hub location and routing problem
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Genetic algorithm for network cost minimization using threshold based discounting
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- An alternative approach to address uncertainty in hub location
- Single allocation hub location with heterogeneous economies of scale
- Perspectives on modeling hub location problems
- Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount
Uses Software
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)
