Results 1  10
of
15
Variable Neighborhood Search
, 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract

Cited by 242 (24 self)
 Add to MetaCart
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computerassisted discovery of conjectures in graph theory.
Variable Neighborhood Search for Extremal Graphs 6. Analyzing Bounds for the Connectivity Index
, 2000
"... Recently, Araujo and De la Pe~na [1] gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramification index of trees. They also gave bounds for the connectivity index of chemical graphs as a function of this index for maximal subgraphs which ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
Recently, Araujo and De la Pe~na [1] gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramification index of trees. They also gave bounds for the connectivity index of chemical graphs as a function of this index for maximal subgraphs which are trees and the cyclomatic number of the graphs. The ramification index of a tree is first shown to be equal to the number of pending vertices minus 2. Then, in view of extremal graphs obtained with the system AutoGraphiX, all bounds of Araujo and De la Pe\~na [1] are improved, yielding tight bounds, and in one case corrected. Moreover, chemical trees of given order and number of pending vertices with minimum and with maximum connectivity index are characterized.
An Applicationbased Comparison of Automated Theory Formation and Inductive Logic Programming
 Linkoping Electronic Articles in Computer and Information Science (special issue: Proceedings of Machine Intelligence
, 2000
"... Automated theory formation involves the production of examples, concepts and hypotheses about the concepts. The HR program performs automated theory formation and has used to form theories in mathematical domains. In addition to providing a plausible model for automated theory formation, HR has been ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
Automated theory formation involves the production of examples, concepts and hypotheses about the concepts. The HR program performs automated theory formation and has used to form theories in mathematical domains. In addition to providing a plausible model for automated theory formation, HR has been applied to some applications in machine learning. We discuss HR's application to inducing de nitions from examples, scienti c discovery, problem solving and puzzle generation. For each problem, we look at how theory formation was applied, and mention some initial results from using HR.
A Survey of Research on Automated Mathematical ConjectureMaking
 FAJTLOWICZ (EDITORS), AMERICAN MATHEMATICAL SOCIETY
, 2005
"... The first attempt at automating mathematical conjecturemaking appeared in the late1950s. It was not until the mid1980s though that a program produced statements of interest to research mathematicians and actually contributed to the advancement of mathematics. A central and important idea underlyi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
The first attempt at automating mathematical conjecturemaking appeared in the late1950s. It was not until the mid1980s though that a program produced statements of interest to research mathematicians and actually contributed to the advancement of mathematics. A central and important idea underlying this program is the Principle of the Strongest Conjecture: make the strongest conjecture for which no counterexample is known. These two programs as well as other attempts to automate mathematical conjecturemaking are surveyed—the success of a conjecturemaking program, it is found, correlates strongly whether the program is designed to produce statements that are relevant to answering or advancing our mathematical questions.
Trees of extremal connectivity index
 Discrete Appl. Math
"... The connectivity index wα(G) of a graph G is the sum of the weights (d(u)d(v)) α of all edges uv of G, where α is a real number (α � = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The connectivity index wα(G) of a graph G is the sum of the weights (d(u)d(v)) α of all edges uv of G, where α is a real number (α � = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T). Also, for −1 ≤ α < 0, we give a sharp lower bound and a upper bound for wα(T).
Mathematical Applications of Inductive Logic Programming
"... Abstract. The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have driven the development of ILP systems. The application of AI techniques to mathematical discovery tasks, however, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have driven the development of ILP systems. The application of AI techniques to mathematical discovery tasks, however, has largely involved computer algebra systems and theorem provers rather than machine learning systems. We discuss here the application of the HR and Progol machine learning programs to discovery tasks in mathematics. While Progol is an established ILP system, HR has historically not been described as an ILP system. However, many applications of HR have required the production of first order hypotheses given data expressed in a Prologstyle manner, and the core functionality of HR can be expressed in ILP terminology. In (Colton, 2003), we presented the first partial description of HR as an ILP system, and we build on this work to provide a full description here. HR performs a novel ILP routine called Automated Theory Formation, which combines inductive and deductive reasoning to form clausal theories consisting of classification rules and association rules. HR generates definitions using a set of production rules,
Computers and Discovery in Algebraic Graph Theory
 Edinburgh, 2001), Linear Algebra Appl
, 2001
"... We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
An Applicationbased Comparison of Automated Theory Formation and Inductive Logic Programming
"... Formatted using 'etendu style ..."
(Show Context)
Trees of extremal connectivity index
, 2005
"... The connectivity index w�(G) of a graph G is the sum of the weights (d(u)d(v)) � of all edges uv of G, where � is a real number ( � � = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1 ..."
Abstract
 Add to MetaCart
(Show Context)
The connectivity index w�(G) of a graph G is the sum of the weights (d(u)d(v)) � of all edges uv of G, where � is a real number ( � � = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T). Also, for −1� � < 0, we give a sharp lower bound and a upper bound for w�(T). © 2005 Elsevier B.V. All rights reserved.
Recommended citation:
, 2000
"... This URL will also contain a link to the author’s home page. The publishers will keep this article online on the Internet (or its possible replacement network in the future) for a period of 25 years from the date of publication, barring exceptional circumstances as described separately. The online ..."
Abstract
 Add to MetaCart
(Show Context)
This URL will also contain a link to the author’s home page. The publishers will keep this article online on the Internet (or its possible replacement network in the future) for a period of 25 years from the date of publication, barring exceptional circumstances as described separately. The online availability of the article implies a permanent permission for anyone to read the article online, to print out single copies of it, and to use it unchanged for any noncommercial research and educational purpose, including making copies for classroom use. This permission can not be revoked by subsequent transfers of copyright. All other uses of the article are conditional on the consent of the copyright owner. The publication of the article on the date stated above included also the production of a limited number of copies on paper, which were archived in Swedish university libraries like all other written works published in Sweden. The publisher has taken technical and administrative measures to assure that the online version of the article will be permanently accessible using the URL stated above, unchanged, and permanently equal to the archived printed copies at least until the expiration of the publication period. For additional information about the Linköping University Electronic Press and its procedures for publication and for assurance of document integrity, please refer to its WWW home page: