H. Paul Williams

According to our database1, H. Paul Williams authored at least 28 papers between 1968 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
The dependency diagram of a mixed integer linear programme.
J. Oper. Res. Soc., 2017

2016
The dependency diagram of a linear programme.
J. Oper. Res. Soc., 2016

Integer programming as projection.
Discret. Optim., 2016

2012
Combining Equity and Utilitarianism in a Mathematical Programming Model.
Manag. Sci., 2012

2009
Logic and Integer Programming
Logic and Integer Programming 130, Springer, ISBN: 978-0-387-92280-5, 2009

2006
The allocation of shared fixed costs.
Eur. J. Oper. Res., 2006

A new framework for the solution of DEA models.
Eur. J. Oper. Res., 2006

2005
George B Dantzig, 1914-2005.
J. Oper. Res. Soc., 2005

Models for Solving the Travelling Salesman Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

2002
Fairness versus efficiency in charging for the use of common facilities.
J. Oper. Res. Soc., 2002

2001
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming.
INFORMS J. Comput., 2001

2000
The Dual of a Logical Linear Programme.
J. Glob. Optim., 2000

1998
The work of Professor Steven Vajda 1901-1995.
J. Oper. Res. Soc., 1998

Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles.
INFORMS J. Comput., 1998

1997
The splitting of variables and constraints in the formulation of integer programming models.
Eur. J. Oper. Res., 1997

The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland.
Comput. Optim. Appl., 1997

1996
Organizing a social event - A difficult problem of combinatorial optimization.
Comput. Oper. Res., 1996

The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared.
Constraints An Int. J., 1996

Constructing the value function for an Integer Linear Programme over a Cone.
Comput. Optim. Appl., 1996

1993
Model solving in mathematical programming.
Wiley, ISBN: 978-0-471-93581-0, 1993

1984
A duality theorem for linear congruences.
Discret. Appl. Math., 1984

Restricted vertex generation applied as a CRASHing procedure for linear programming.
Comput. Oper. Res., 1984

1983
A characterisation of all feasible solutions to an integer program.
Discret. Appl. Math., 1983

1978
The reformulation of two mixed integer programming problems.
Math. Program., 1978

1976
Fourier-Motzkin Elimination Extension to Integer Programming Problems.
J. Comb. Theory, Ser. A, 1976

1975
Analysis of mathematical programming problems prior to applying the simplex algorithm.
Math. Program., 1975

1969
A formalisation of the arithmetic of the ordinals less than W<sup>ω</sup>.
Notre Dame J. Formal Log., 1969

1968
The Synthesis of Logical Nets Consisting of NOR Units.
Comput. J., 1968


  Loading...