Journal of Advanced Transportation · 1998 · 102 citations · 14 references
Natural SciencesMathematicsOperations ManagementOperations ResearchOptimizationTransportation EngineeringAssignment ProblemsCombinatorial OptimizationNetwork Flow AlgorithmsNetwork FlowsNetwork OptimizationShortest Path AlgorithmsLagrangian FormulationLagrangian FunctionLagrangian RelaxationNetwork Flow FormulationsNetwork Flow OptimizationShortest Path HeuristicsShortest Path OptimizationShortest Path Problems
Abstract In this research we developed a network model that will help the airport authorities assign flights to gates both efficiently and effectively. The model was formulated as a multi‐commodity network flow problem. An algorithm based on the Lagrangian relaxation, with subgradient methods, accompanied by a shortest path algorithm and a Lagrangian heuristic was developed to solve the problem. The model was tested using data from Chiang Chiek‐Shek Airport.
14
Network Flows: Theory, Algorithms, and Applications.
David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text
Network flows: Theory, algorithms and applications
Discrete Applied Mathematics · 1994 · 2.6K citations