Lexicographic Breadth First Search, introduced by Rose, Tarjan and Lueker for the recognition of chordal graphs is currently the most popular graph algorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new direction...

We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a telephone book, so requests like “give directions from the Lackawanna Diner to the nearest dry cleaner’* (properly specified) can be answered. This problem involves both human factors and algorithmic problems. From the human factors standpoint, what kind of route is best:...

We address the solution of convex-constrained nonlinear systems of equations where the Jacobian matrix is unavailable or its computation/storage is burdensome. In order to efficiently solve such problems, we propose a new class of algorithms which are “derivativefree” both in the computation of the search direction and in the selection of the steplength. Search directions comprise the residuals...

The cycle of abstraction-reconstruction, which occurs as a fundamental principle in the development of culture and in cognitive processes, is described and analyzed. This approach leads to recognition of boundary conditions for and directions of probable development of cognitive tools. It is shown how the transition from a conventional Japanese-English character dictionary to a multi-dimensiona...

In this paper, we give a unified analysis for both largeand small-update interior-point methods for the Cartesian P∗(κ )-linear complementarity problem over symmetric cones based on a finite barrier. The proposed finite barrier is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the algorithm. The symmetry of the result...

Hybridization of local search based algorithms with evolutionary algorithms is still an under-explored research area in multiobjective optimization. In this paper, we propose a new multiobjective algorithm based on a local search method. The main idea is to generate new non-dominated solutions by adding a linear combination of descent directions of the objective functions to a parent solution ....

In this work we devise eecient algorithms for nding the search directions for interior point methods applied to linear programming problems. There are two innovations. The rst is the use of updating of preconditioners computed for previous barrier parameters. The second is an adaptive automated procedure for determining whether to use a direct or iterative solver, whether to reinitialize or upd...

Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite linear complementarity problem (SDLCP) and established polynomial convergence of a feasible short-step pathfollowing algorithm based on a particular direction of their family. The question of whether polynomiality could be established for any direction of their family thus remained an open problem. This paper a...

A previous analysis of second-order behavior of generalized pattern search algorithms for unconstrained and linearly constrained minimization is extended to the more general class of mesh adaptive direct search (MADS) algorithms for general constrained optimization. Because of the ability of MADS to generate an asymptotically dense set of search directions, we are able to establish reasonable c...

We investigate some improvements and recent developments in the game-tree search techniques, which have influenced development of modern computer chess programs. We shall present an overview of various search heuristics to the basic Alpha-Beta (AB) pruning algorithm in order to achieve good move ordering (Iterative Deepening, Killer Heuristic, History Heuristic, Transposition Tables and Aspirat...