Joost P. Warners

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2004 J jnl
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
J. Comb. Optim.
Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners
2003 J jnl
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Ann. Math. Artif. Intell.
Hans van Maaren, Joost P. Warners
2000 J jnl
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
Discret. Appl. Math.
Hans van Maaren, Joost P. Warners
2000 J jnl
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
Discret. Appl. Math.
Joost P. Warners, Hans van Maaren
2000 J jnl
Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reason.
Etienne de Klerk, Hans van Maaren, Joost P. Warners
2000 J jnl
Solving satisfiability problems using elliptic approximations - effective branching rules.
Discret. Appl. Math.
Joost P. Warners, Hans van Maaren
2000 J jnl
The Propositional Formula Checker HeerHugo.
J. Autom. Reason.
Jan Friso Groote, Joost P. Warners
1999 J jnl
Radio Link Frequency Assignment.
Constraints An Int. J.
Bertrand Cabon, Simon de Givry, Lionel Lobjois, Thomas Schiex, Joost P. Warners
1998 J jnl
A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form.
Inf. Process. Lett.
Joost P. Warners
1998 J jnl
A two-phase algorithm for solving a class of hard satisfiability problems.
Oper. Res. Lett.
Joost P. Warners, Hans van Maaren
1997 J jnl
A Potential Reduction Approach to the Frequency Assignment Problem.
Discret. Appl. Math.
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
1997 J jnl
Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett.
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen