Abstract
The discrete network design problem is that we select links so that we can efficiently process the flow in a network.This is formulated as a nonlinear combinatorial optimization problem.But it is hard that we can get the exact optimal solution of this problem.This paper proposes three efficiently heuristic algorithms that are greedy, dual and local search algorithms, and a construction order algorithm.Thsese algorithms solve efficiently a large discrete network design model.
