Learn More
Many problems in operations research can be formulated in terms of networks, among which the shortest path is a particularly important class. Using the PAR method, we formally derive and implement algorithmic programs for three typical network problems, including the shortest path tree (SPT) problem, the most vital edge (MVE) problem, and the real time(More)
Branch-and-bound and backtracking are widely used for search and optimization problems, but their implementations vary from problem to problem. In this paper we propose a unified approach of program derivation and generation for the two classes of algorithms. We first define a generalized specification for the search strategies, and then derive the(More)
Traditional approaches to apply tabu search method typically require formulating an algorithmic structure for each individual problem. Based on algebraic specifications, the paper presents a unified and mechanical framework for implementing tabu search algorithms for combinatorial optimization problems. We define a generalized specification using high-order(More)
  • Haihe Shi
  • 2011 6th International Conference on Computer…
  • 2011
Management Information System (MIS) is a core course of business administration major. However it is hard for students to grasp and practice in real life. The existing problems of current teaching are analyzed in the paper, and a practical teaching approach is proposed to address the existing problems. The approach emphasizes active rational participation(More)
The problem reduction graph (PRG) is a model for formally describing the reduction processes of combinatorial optimization problems and systematically deriving efficient algorithms for the problems. The paper applies the model for several optimization problems including vehicle loading, vehicle routing, and warehouse location, which are typical problems in(More)
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science. However, some students think it hard to grasp and often learn by rote, thus they usually can't improve their ability of algorithm design and algorithm analysis. To address the problem, we advocate the incorporation of formal derivation into the design(More)
Formal algorithm derivation is valuable in ensuring resultant algorithm correctness, revealing ideas behind algorithm, and studying automatic algorithm design. An approach called mechanical partition-and-recur (MPAR for short) for deriving algorithmic program is presented. It is built on top of formal method PAR, and provides a series of strategies for(More)