Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the nodes and connects the nodes at each level by facilities of the corresponding or higher type. This problem generalizes the well-known Steiner network problem and the hierarchical network design problem, and has applications in telecommunication, transportation, and electric power distribution network design. In a companion paper we introduced the problem, studied alternative model formulations, and analyzed the worst-case performance of heuristics based on Steiner network and spanning tree solutions. This paper develops and tests a dual-based algorithm for the Multi-level Network Design (MLND) problem. The method first performs problem preprocessing to fix certain design variables, and then applies a dual ascent procedure to generate upper and lower bounds on the optimal value. We report extensive computational results on large, random networks (containing up to 500 nodes, and 5000 edges) with varying cost structures. The integer programming formulation of the largest of these problems has 20,000 integer variables and over 5 million constraints. Our tests indicate that the dualbased algorithm is very effective, producing solutions guaranteed to be within 0 to 0.9% of optimality.

A new method for multi-objective optimization of linear and mixed programs based on Lagrange multiplier methods is developed. The method resembles, but is distinct from, objective function weighting and goal programming methods. A subgradient optimization algorithm for selecting the multipliers is presented and analyzed. The method is illustrated by its application to a model for determining the weekly re-distribution of railroad cars from excess supply areas to excess demand areas, and to a model for balancing cost minimization against order completion requirements for a dynamic lot size model.

Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 74-78).

No description available.

The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities for the Asymmetric TSP can be easily extended to the TDTSP, but the added time information can be used to strengthen these inequalities. We look at extending the Lifted Cycle Inequalities, a large family of inequalities for the ATSP. We define a new inequality, the Extended Cycle (X-cycle) Inequality, based on cycles in the graph. We extend the results of Balas and Fischetti for Lifted Cycle Inequalities to define Lifted X-cycle Inequalities. We show that the Lifted X-cycle Inequalities include some inequalities which define facets of the submissive of the TDTS Polytope.

No description available.

Many researchers had developed polyphase sequences, so called ¡§perfect sequence¡¨ or ¡§ideal sequence¡¨, with ideal periodic auto-correlation function. There are lots of applications of communication system depends on the sequences with good auto-correlation property, i.e., synchronization, channel estimation and multiple access. These sequences cannot maintain the ideal property in implementation, because of the error of quantization in digital signal processing of transmitter. On the contrary, we develop a novel set of perfect sequences, Gaussian Integer Perfect Sequence (GIPS), which only contains Gaussian integers. In this paper, we construct them by linear combination and cyclic shift of the eight base sequences. We present the design and basic properties of the sequences. Furthermore, the design method of sequences with the smallest dynamic range is presented.

Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 71-73).

Thesis (Ph. D.)--West Virginia University, 2002. / Title from document title page. Document formatted into pages; contains xi, 158 p. : ill. (some col.), col. map. Vita. Includes abstract. Includes bibliographical references (p. 126-132).

Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 110-113). Also available on the Internet.