This paper presents a nonlinear 0 1 integer programming model for the combined local and through freight train routing / makeup problem from the viewpoint of network flows and combinatorial optimization. 从网络流与组合优化的观点研究直达与区段列车编组计划、车流运行径路的整体优化问题,并建立了该问题的非线性0-1整数规划模型。