Branching Rules for Satisfiabiblity.
Year of publication: |
1994
|
---|---|
Authors: | Hooker, J.N. ; Vinay, V. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | computers | algorithms |
-
Cost Minimisation of Multiple‐vehicle Shipments
Haessler, Robert W., (1991)
-
An improved minimal cut set algorithm
Kara‐Zaitri, Chakib, (1996)
-
The cultural logic of computation
Golumbia, David, (2009)
- More ...
-
On a Class of Routing and Scheduling Problems that are Soluble on Graphs.
Hooker, J.N., (1991)
-
BRANCH-AND-CUT SOLUTION OF INFERENCE PROBLEMS IN PROPOSITIONAL LOGIC
HOOKER, J.N., (1989)
-
Predicting Cause-Effect Relationships from Incomplete Discrete Observations.
Boros, E., (1991)
- More ...