Results 1  10
of
96
A conical branchandbound algorithm for a class of reverse convex programs
 University of Tsukuba
, 2005
"... The purpose of this paper is to construct a conical branchandbound algorithm for solving linear programming problems with an additional reverse convex constraint. We propose an inexpensive boundtightening procedure, which is based on the surrogate relaxation. We show that this procedure conside ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The purpose of this paper is to construct a conical branchandbound algorithm for solving linear programming problems with an additional reverse convex constraint. We propose an inexpensive boundtightening procedure, which is based on the surrogate relaxation. We show that this procedure
A lifted linear programming branchandbound algorithm for mixed integer conic quadratic programs
, 2007
"... This paper develops a linear programming based branchandbound algorithm for mixed integer conic quadratic programs. The algorithm is based on a higher dimensional or lifted polyhedral relaxation of conic quadratic constraints introduced by BenTal and Nemirovski. The algorithm is different from o ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
other linear programming based branchandbound algorithms for mixed integer nonlinear programs in that, it is not based on cuts from gradient inequalities and it sometimes branches on integer feasible solutions. The algorithm is tested on a series of portfolio optimization problems. It is shown
A note on the robust international sourcing algorithm of Gutierrez and Kouvelis. working paper
, 2003
"... We discuss an error contained in Gutérrez and Kouvelis’s (1995) branchandbound algorithm for a robust international sourcing problem, which reduces to a robust version of the uncapacitated fixedcharge location problem (UFLP). The algorithm takes parameters p and N and attempts to find either the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We discuss an error contained in Gutérrez and Kouvelis’s (1995) branchandbound algorithm for a robust international sourcing problem, which reduces to a robust version of the uncapacitated fixedcharge location problem (UFLP). The algorithm takes parameters p and N and attempts to find either
Semisupervised Clustering of Graph Objects: A Subgraph Mining Approach
"... Abstract. Semisupervised clustering has recently received a lot of attention in the literature, which aims to improve the clustering performance with limited supervision. Most existing semisupervised clustering studies assume that the data is represented in a vector space, e.g., text and relation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
straints to guide the subgraph feature mining and selection process. We derive an upper bound of the objective function based on which, a branchandbound algorithm is proposed to speedup subgraph mining. We also introduce a redundancy measure into the feature selection process in order to reduce the redundancy
A BranchandBound Based Heuristic Algorithm for Minimizing Makespan in
, 2014
"... This paper proposes a heuristic algorithm, called listbased squeezing branch and bound algorithm, for solving a machinefixed, machiningassembly flowshop scheduling problem to minimize makespan. The machinefixed, machiningassembly flowshop consists of some parallel twomachine flow lines at a ..."
Abstract
 Add to MetaCart
This paper proposes a heuristic algorithm, called listbased squeezing branch and bound algorithm, for solving a machinefixed, machiningassembly flowshop scheduling problem to minimize makespan. The machinefixed, machiningassembly flowshop consists of some parallel twomachine flow lines at a
An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): symbolic branchandbound search vs. connectionist Hopfield net activation
 Journal of the American Society for Information Science
, 1995
"... This paper presents a framework for knowledge discovery and concept exploration. In order to enhance the concept exploration capability of knowledgebased systems and to alleviate the limitations of the manual browsing approach, we have developed two spreading activationbased algorithms for concep ..."
Abstract

Cited by 72 (18 self)
 Add to MetaCart
for concept exploration in large, heterogeneous networks of concepts (e.g., multiple thesauri). One algorithm, which is based on the symbolic Al paradigm, performs a conventional branchandbound search on a semantic net representation to identify other highly relevant concepts (a serial, optimal search
Parallel Induction Systems based on Branch and Bound
"... Symbolic inductive learning systems explore a space of hypotheses to derive the definition of concepts. Due to the size and complexity of this space, sequential algorithms use various heuristics that limit the classification accuracy of the generated definitions. Parallel search algorithm can rect ..."
Abstract
 Add to MetaCart
Symbolic inductive learning systems explore a space of hypotheses to derive the definition of concepts. Due to the size and complexity of this space, sequential algorithms use various heuristics that limit the classification accuracy of the generated definitions. Parallel search algorithm can
Anytime, complete algorithm for finding utilitarian optimal solutions to STPPs
 In 20th National Conference on Artificial Intelligence (AAAI 2005
, 2005
"... We present a simple greedy algorithm and a novel complete algorithm for finding utilitarian optimal solutions to Simple Temporal Problems with Preferences. Unlike previous algorithms, ours does not restrict preference functions to be convex. We present experimental results showing that (1) a sing ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
gle iteration of the greedy algorithm produces highquality solutions, (2) multiple iterations, bounded by the square of the number of constraints, produce nearoptimal solutions, and (3) our complete, memoryboundable algorithm has compelling anytime properties and outperforms a branchandbound algorithm.
AND
"... ABSTRACT. Branchandbound implicit enumeration algorithms for permutation problems (discrete optimization problems where the set of feasible solutions is the permutation group S~) are characterized in terms of a sextuple (Bp, S,E,D,L,U), where (1) B ~ is the branching rule for permutation problems ..."
Abstract
 Add to MetaCart
of the computational requirements on the choice of algorithm parameters S, E, D, L, and U is investigated theoretically. The results verify some intuitive notions but disprove others. KEY "WORDS AND PHRASES: discrete optimization, branchandbound implicit enumeration algorithms, permutation problems, sextuple
A Polynomial Time Upper Bound for the Number of Contacts in the
"... ABSTRACT: Lattice protein models are a major tool for investigating principles of protein folding. For this purpose, one needs an algorithm that is guaranteed to find the minimal energy conformation in some lattice model (at least for some sequences). So far, there are only algorithm that can find ..."
Abstract
 Add to MetaCart
find optimal conformations in the cubic lattice. In the more interesting case of the facecenteredcubic lattice (FCC), which is more proteinlike, there are no results. One of the reasons is that for finding optimal conformations, one usually applies a branchandbound technique
Results 1  10
of
96