The following pages link to Hans van Maaren (Q186236):
Displaying 46 items.
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- (Q870058) (redirect page) (← links)
- A new method to construct lower bounds for van der Waerden numbers (Q870059) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- An arbitrary starting variable dimension algorithm for computing an integer point of a simplex (Q1303784) (← links)
- A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
- (Q1384431) (redirect page) (← links)
- Pivoting algorithms based on Boolean vector labeling (Q1384432) (← links)
- (Q1598875) (redirect page) (← links)
- Simplicial pivoting algorithms for a tractable class of integer programs (Q1598876) (← links)
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights (Q1861906) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)
- (Q2749859) (← links)
- A Simplicial Approach to the Determination of an Integer Point of a Simplex (Q2757541) (← links)
- (Q3429156) (← links)
- (Q3479836) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- (Q3604001) (← links)
- (Q3604002) (← links)
- From Idempotent Generalized Boolean Assignments to Multi-bit Search (Q3612462) (← links)
- Effective Incorporation of Double Look-Ahead Procedures (Q3612471) (← links)
- Dynamic Symmetry Breaking by Simulating Zykov Contraction (Q3637171) (← links)
- (Q3707767) (← links)
- (Q3732429) (← links)
- (Q3912850) (← links)
- (Q3921287) (← links)
- (Q3937947) (← links)
- (Q3976099) (← links)
- (Q4043171) (← links)
- (Q4375779) (← links)
- (Q5201909) (← links)
- Theory and Applications of Satisfiability Testing (Q5325856) (← links)
- Theory and Applications of Satisfiability Testing (Q5713720) (← links)
- Theory and Applications of Satisfiability Testing (Q5713752) (← links)
- Theory and Applications of Satisfiability Testing (Q5714747) (← links)
- Theory and Applications of Satisfiability Testing (Q5714768) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
