The pure fixed charge transportation problem is reformulated into an equivalent set covering problem with, in general, a large number of constraints. Two constraint generation procedures for its solution are suggested; in both of these, new constraints are generated by the solution of ordinary maximum flow problems. In the first procedure, which is an optimizing Benders-type scheme, each set co...

The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and production scheduling. We develop a family of dual ascent algorithms for this problem. This approach generalizes known ascent procedures for solving shortest path, plant location, Steiner network and directed spanning tree problems. Our computational results for several c...

This paper addresses two second-best toll pricing problems, one with fixed and the other with elastic travel demands, as mathematical programs with equilibrium constraints. Several equivalent nonlinear programming formulations for the two problems are discussed. One formulation leads to properties that are of interest to transportation economists. Another produces an algorithm that is capable o...