Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
From MaRDI portal
Publication:1854755
DOI10.1023/A:1021145103592zbMath1013.90010OpenAlexW1579685617MaRDI QIDQ1854755
Publication date: 27 January 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021145103592
Related Items
Constraint programming and operations research ⋮ Optimization models for forest road upgrade planning ⋮ Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem ⋮ On interval-subgradient and no-good cuts ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Cost-based decision-making in middleware virtualization environments ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ Approximated consistency for the automatic recording constraint ⋮ Logic-based MultiObjective Optimization for Restoration Planning ⋮ Transshipment service through crossdocks with both soft and hard time windows
