Results 1  10
of
4,094
PartiallyOrdered Knapsack and Applications to Scheduling
, 2002
"... In the partiallyordered knapsack problem (POK) we are given a set N of items and a partial order on N. Each item has a size and an associated weight. The objective is to pack a set N # N of maximum weight in a knapsack of bounded size. N # should be precedenceclosed, i.e., be a valid pref ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In the partiallyordered knapsack problem (POK) we are given a set N of items and a partial order on N. Each item has a size and an associated weight. The objective is to pack a set N # N of maximum weight in a knapsack of bounded size. N # should be precedenceclosed, i.e., be a valid
New Directions in Cryptography
, 1976
"... Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper sug ..."
Abstract

Cited by 3499 (7 self)
 Add to MetaCart
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO Artificial Intelligence
, 1986
"... Scope and PurposeA summary is provided of some of the recent (and a few notsorecent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and arti ..."
Abstract

Cited by 356 (8 self)
 Add to MetaCart
Scope and PurposeA summary is provided of some of the recent (and a few notsorecent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and artificial intelligence. Although compatible with the use of algorithmic subroutines, the frameworks examined are primarily heuristic, based on the supposition that etTective solution of complex combinatorial structures in some cases may require a level of flexibility beyond that attainable by methods with formally demonstrable convergence properties. AbstractInteger programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating these innovations in the future may be viewed from a framework that links the perspectives of artificial intelligence and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
Interactive Knapsacks
, 1999
"... The interactive knapsack problems are generalizations of the classical knapsack problem. Three dierent new NPcomplete problems, IKHD, IKD and MDCS, are presented for the interactive knapsack models, which are also new. IKD and MDCS are shown to be strongly NPcomplete. By using interactive knapsac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
knapsacks we model many planning and scheduling problems in an innovative way. We show Interactive knapsacks to have several applications, for example, in electricity management, single and multiprocessor scheduling and packing of two, three and n dimensional items to dierent containers. Many natural
A knapsack secretary problem with applications
 In APPROX ’07
, 2007
"... Fellowship. Portions of this work were completed while the author was a postdoctoral ..."
Abstract

Cited by 53 (5 self)
 Add to MetaCart
Fellowship. Portions of this work were completed while the author was a postdoctoral
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
 ACM COMPUTING SURVEYS
, 2003
"... The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important meta ..."
Abstract

Cited by 294 (16 self)
 Add to MetaCart
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important
The Sequential Knapsack Polytope
 MATHEMATICAL PROGRAMMING
, 1998
"... In this paper we describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are defined via an inductive scheme that can also be used in a more general setting. ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
In this paper we describe the convex hull of all solutions of the integer bounded knapsack problem in the special case when the weights of the items are divisible. The corresponding inequalities are defined via an inductive scheme that can also be used in a more general setting.
Results 1  10
of
4,094