Pages that link to "Item:Q753688"

The following pages link to Computational experience with an interior point algorithm on the satisfiability problem (Q753688):

Displaying 20 items.

• A continuous approach to inductive inference (Q687090) (← links)
• Interior-point algorithms for global optimization (Q804475) (← links)
• Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
• An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
• New methods for computing inferences in first order logic (Q1309900) (← links)
• Generating logical expressions from positive and negative examples via a branch-and-bound approach (Q1318514) (← links)
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
• Potential reduction algorithms for structured combinatorial optimization problems (Q1373458) (← links)
• A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
• A BDD SAT solver for satisfiability testing: An industrial case study (Q1380431) (← links)
• Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
• Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
• Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
• Matrix representation and gradient flows for NP-hard problems (Q1906756) (← links)
• An approach to guided learning of Boolean functions (Q1910784) (← links)
• On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
• The \(Multi\)-SAT algorithm (Q1961449) (← links)
• The state of SAT (Q2643296) (← links)
• Some pitfalls for experimenters with random SAT (Q2674180) (← links)