


default search action
H. Paul Williams
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j25]H. Paul Williams:
The dependency diagram of a mixed integer linear programme. J. Oper. Res. Soc. 68(7): 829-833 (2017) - 2016
- [j24]H. Paul Williams, John N. Hooker:
Integer programming as projection. Discret. Optim. 22: 291-311 (2016) - [j23]H. Paul Williams:
The dependency diagram of a linear programme. J. Oper. Res. Soc. 67(3): 450-456 (2016) - 2012
- [j22]John N. Hooker, H. Paul Williams:
Combining Equity and Utilitarianism in a Mathematical Programming Model. Manag. Sci. 58(9): 1682-1693 (2012)
2000 – 2009
- 2009
- [b2]H. Paul Williams:
Logic and Integer Programming. Logic and Integer Programming 130, Springer 2009, ISBN 978-0-387-92279-9, pp. 1-144 - 2006
- [j21]Martin Butler, H. Paul Williams:
The allocation of shared fixed costs. Eur. J. Oper. Res. 170(2): 391-397 (2006) - [j20]Gautam Appa, H. Paul Williams:
A new framework for the solution of DEA models. Eur. J. Oper. Res. 172(2): 604-615 (2006) - 2005
- [j19]H. Paul Williams:
George B Dantzig, 1914-2005. J. Oper. Res. Soc. 56(12): 1349-1350 (2005) - [c2]H. Paul Williams:
Models for Solving the Travelling Salesman Problem. CPAIOR 2005: 17-18 - 2002
- [j18]Martin Butler, H. Paul Williams:
Fairness versus efficiency in charging for the use of common facilities. J. Oper. Res. Soc. 53(12): 1324-1329 (2002) - 2001
- [j17]H. Paul Williams, Hong Yan
:
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming. INFORMS J. Comput. 13(2): 96-103 (2001) - 2000
- [j16]H. Paul Williams:
The Dual of a Logical Linear Programme. J. Glob. Optim. 18(2): 129-141 (2000)
1990 – 1999
- 1998
- [j15]H. Paul Williams, John M. Wilson:
Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles. INFORMS J. Comput. 10(3): 261-264 (1998) - [j14]K. Brian Haley, H. Paul Williams:
The work of Professor Steven Vajda 1901-1995. J. Oper. Res. Soc. 49(3): 298-301 (1998) - 1997
- [j13]Martin Butler, H. Paul Williams, Leslie-Ann Yarrow:
The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland. Comput. Optim. Appl. 7(3): 291-306 (1997) - [j12]H. Paul Williams, Sally C. Brailsford
:
The splitting of variables and constraints in the formulation of integer programming models. Eur. J. Oper. Res. 100(3): 623-628 (1997) - 1996
- [j11]H. Paul Williams:
Constructing the value function for an Integer Linear Programme over a Cone. Comput. Optim. Appl. 6(1): 15-26 (1996) - [j10]Barbara M. Smith, Sally C. Brailsford
, Peter M. Hubbard, H. Paul Williams:
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. Constraints An Int. J. 1(1/2): 119-138 (1996) - [j9]Sally C. Brailsford
, Peter M. Hubbard, Barbara M. Smith, H. Paul Williams:
Organizing a social event - A difficult problem of combinatorial optimization. Comput. Oper. Res. 23(9): 845-856 (1996) - 1995
- [c1]Barbara M. Smith, Sally C. Brailsford
, Peter M. Hubbard, H. Paul Williams:
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. CP 1995: 36-52 - 1993
- [b1]Hilary Paul Williams:
Model solving in mathematical programming. Wiley 1993, ISBN 978-0-471-93581-0, pp. I-XIII, 1-359
1980 – 1989
- 1984
- [j8]H. Paul Williams:
Restricted vertex generation applied as a CRASHing procedure for linear programming. Comput. Oper. Res. 11(4): 401-407 (1984) - [j7]H. Paul Williams:
A duality theorem for linear congruences. Discret. Appl. Math. 7(1): 93-103 (1984) - 1983
- [j6]H. Paul Williams:
A characterisation of all feasible solutions to an integer program. Discret. Appl. Math. 5(1): 147-155 (1983)
1970 – 1979
- 1978
- [j5]H. Paul Williams:
The reformulation of two mixed integer programming problems. Math. Program. 14(1): 325-331 (1978) - 1976
- [j4]H. Paul Williams:
Fourier-Motzkin Elimination Extension to Integer Programming Problems. J. Comb. Theory A 21(1): 118-123 (1976) - 1975
- [j3]A. L. Brearley, Gautam Mitra, H. Paul Williams:
Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8(1): 54-83 (1975)
1960 – 1969
- 1969
- [j2]H. Paul Williams:
A formalisation of the arithmetic of the ordinals less than Wω. Notre Dame J. Formal Log. 10(1): 77-89 (1969) - 1968
- [j1]H. Paul Williams:
The Synthesis of Logical Nets Consisting of NOR Units. Comput. J. 11(2): 173-176 (1968)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint