Results 1  10
of
1,533,728
Where are the hard knapsack problems
 Computers and Operations Research
, 2005
"... The knapsack problem is believed to be one of the “easier ” N Phard problems. Not only can it be solved in pseudopolynomial time, but also decades of algorithmic improvements have made it possible to solve nearly all standard instances from the literature. The purpose of this paper is to give an o ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
The knapsack problem is believed to be one of the “easier ” N Phard problems. Not only can it be solved in pseudopolynomial time, but also decades of algorithmic improvements have made it possible to solve nearly all standard instances from the literature. The purpose of this paper is to give
Hard Knapsack Problems That Are Easy for Local Search
"... Chv'atal (1980) describes a class of zeroone knapsack problems provably difficult for branch and bound and dynamic programming algorithms. Chung et al. (1988) identifies a class of integer knapsack problems hard for branch and bound algorithms. We show that for both classes of problems local s ..."
Abstract
 Add to MetaCart
Chv'atal (1980) describes a class of zeroone knapsack problems provably difficult for branch and bound and dynamic programming algorithms. Chung et al. (1988) identifies a class of integer knapsack problems hard for branch and bound algorithms. We show that for both classes of problems local
Simple Lifted Cover Inequalities and Hard Knapsack Problems
, 2004
"... We consider a class of random knapsack instances described by Chvátal, who showed that with probability going to 1, such instances require an exponential number of branchandbound nodes. We show that even with the use of simple lifted cover inequalities, an exponential number of nodes is required w ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
is not suggested by the NPhardness of binary knapsack problems, because cover inequality separation for these problems is NPhard [6]. 1
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 822 (39 self)
 Add to MetaCart
in the proof (though this number is a very slowly growing function of the input length). As a consequence we prove that no MAX SNPhard problem has a polynomial time approximation scheme, unless NP=P. The class MAX SNP was defined by Papadimitriou and Yannakakis [82] and hard problems for this class include
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3712 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
A Note on the Confinement Problem
, 1973
"... This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified. ..."
Abstract

Cited by 532 (0 self)
 Add to MetaCart
This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.
The Symbol Grounding Problem
, 1990
"... There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system be m ..."
Abstract

Cited by 1072 (18 self)
 Add to MetaCart
There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system
Results 1  10
of
1,533,728