2006 · 16 citations · 9 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer NetworksOptimizationApproximation AlgorithmsCombinatorial OptimizationInteger ProgrammingNetwork OptimizationNumerical AlgorithmsOptimization-based DesignApproximate OptimizationElastic NetworkingMixed-integer OptimizationMixed-integer ProgrammingMpls NetworkingNetwork Design ApproximationNetwork Design ProblemsRobust Network Optimization
Design problems related to the next generation Internet core networks can be difficult to solve in an exact way. Hence, for large networks they may require approximate algorithms. The paper considers two optimization problems for off-line design of robust NGI core networks carrying elastic traffic with a two-layer IP/MPLS over WDM architecture. The problems are NP-hard and are formulated as mixed-integer programs. An efficient approximate iterative method based on separate design of the two layers is proposed for solving the problems; the method is illustrated with numerical examples
9
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
An Automatic Method of Solving Discrete Programming Problems
A. H. Land, A. G. Doig · Econometrica · 1960 · 1.9K citations