Hooker J.N.

J.N. Hooker

Information about the author J.N. Hooker will soon be added to the site.
Found 18 papers in total
Planning and scheduling by logic-based Benders decomposition
Planning and scheduling by logic-based Benders decomposition
2007
We combine mixed-integer linear programming (MILP) and constraint programming (CP) to...
Logic-based Benders decomposition
Logic-based Benders decomposition
2003
Benders decomposition uses a strategy of “learning from one's mistakes”....
A declarative modeling framework that integrates solution methods
A declarative modeling framework that integrates solution methods
2001
Constraint programming offers modeling features and solution methods that are...
Optimal design of truss structures by logic-based branch and cut
Optimal design of truss structures by logic-based branch and cut
2001
The truss design problem is to find the optimal placement and size of structural bars...
Inference-based sensitivity analysis for mixed integer/linear programming
Inference-based sensitivity analysis for mixed integer/linear programming
2000
A new method of sensitivity analysis for mixed integer/linear programming (MILP) is...
Testing heuristics: We have it all wrong
Testing heuristics: We have it all wrong
1995
The competitive nature of most algorithmic experimentation is a source of problems...
Mixed logical–linear programming
Mixed logical–linear programming
1999
Mixed logical–linear programming (MLLP) is an extension of mixed...
Tight representation of logical constraints as cardinality rules
Tight representation of logical constraints as cardinality rules
1999
A mathematical programming model may contain qualitative as well as quantitative...
The 2-centdian problem: A rejoinder
The 2-centdian problem: A rejoinder
1998
Pérez-Brito et al. provide a counterexample to a finite dominating set (FDS)...
A computational study of satisfiability algorithms for propositional logic
A computational study of satisfiability algorithms for propositional logic
1994
We implement several recent algorithms for the satisfiability problem in propositional...
A linear programming framework for logics of uncertainty
A linear programming framework for logics of uncertainty
1996
Several logics for reasoning under uncertainty distribute ‘probability...
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
1996
In this paper the authors consider the problem of determining lower and upper bounds...
Boolean regression
Boolean regression
1995
The authors take a regression-based approach to the problem of induction, which is the...
Needed: An empirical science of algorithms
Needed: An empirical science of algorithms
1994
Deductive algorithmic science has reached a high level of sophistication, but its...
Logic cuts for processing networks with fixed charges
Logic cuts for processing networks with fixed charges
1994
The authors show how some simple logical constraints can substantially accelerate the...
New methods for computing inferences in first order logic
New methods for computing inferences in first order logic
1993
Recent improvements in satisfiability algorithms for propositional logic have made...
Finite dominating sets for network location problems
Finite dominating sets for network location problems
1991
A research theme involving location on networks, since its inception, has been the...
Generalized resolution and cutting planes
Generalized resolution and cutting planes
1988
This paper illustrates how the application of integer programming to logic can reveal...
Papers per page: