J. P. Warners

发表

On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function

D. V. Pasechnik, E. de Klerk, J. P. Warners, 2002 .

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function

J. P. Warners, E. D. Klerk, D. Pasechnik, 2004, J. Comb. Optim..

Nonlinear approaches to satisfiability problems

J. P. Warners, J. Warners, 1999 .

The Propositional Formula Checker HeerHugo

Jan Friso Groote, J. F. Groote, Joost P. Warners, 2000, Journal of Automated Reasoning.

The Use of Low-rank Updates in Interior-point Methods

J. P. Warners, E. Andersen, T. Terlaky, 2022 .

A nonlinear approach to a class of combinatorial optimization problems

J. P. Warners, 1998 .

Nonconvex continuous models for combinatorial optimization problems with application to satisfiability and node packing problems

J. P. Warners, 1997 .

Relaxations of the Satis ability Problem using Semide niteProgrammingEtienne

J. P. Warners, De, Klerka, 2000 .

The Propositional Formula Checker

J. F. Groote, J. P. Warners, 1999 .

Radio Link Frequency Assignment

Simon de Givry, Thomas Schiex, Bertrand Cabon, 1999, Constraints.

Centrum voor Wiskunde en Informatica REPORTRAPPORT Report SEN-R9903

Etienne de Klerk, Hans van Maaren, Joost P. Warners, 1999 .

Solving satisfiability problems using elliptic approximations - effective branching rules

Hans van Maaren, Joost P. Warners, J. P. Warners, 2000, Discret. Appl. Math..

Unsupervised Neural Network Training Via a Potential Reduction Approach

Theodore B. Trafalis, Cornelis Roos, Joost P. Warners, 1996 .

A two phase algorithm for solving a class of hard satissfiability problems

Hans van Maaren, Joost P. Warners, J. P. Warners, 1998 .

Potential reduction algorithms for structured combinatorial optimization problems

Tamás Terlaky, Kees Roos, Joost P. Warners, 1997, Oper. Res. Lett..

A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form

Joost P. Warners, J. P. Warners, 1998, Inf. Process. Lett..