doi.bio/gerard_j_kleywegt

Gerard J. Kleywegt

Early Life and Education

Gerard Jacob Kleywegt was born on 5 June 1962 in Rozenburg, the Netherlands. He obtained his PhD from the University of Utrecht in 1991 and later conducted postdoctoral research with Alwyn Jones at Uppsala University.

Career and Research

Kleywegt is a Dutch X-ray crystallographer specialising in protein crystallography and the Protein Data Bank. He was formerly the team leader of the Protein Data Bank in Europe at the European Bioinformatics Institute (EMBL-EBI), which is a member of the Worldwide Protein Data Bank consortium.

Kleywegt has authored and co-authored numerous scientific papers, including:

The Protein Data Bank archive as an open data resource (2014)
PDBe: Protein Data Bank in Europe (2014)
PDBe: improved accessibility of macromolecular structure data from PDB and EMDB (2016)
EMDataBank unified data resource for 3DEM (2016)
AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models (2022)
Ten recommendations for organising bioimaging data for archival (co-authored)
Providing open imaging data at scale: An EMBL-EBI perspective
Public archiving of volume EM data

Current Affiliations

Kleywegt is currently affiliated with the Wellcome Genome Campus Advanced Courses and Scientific Conferences.

Google Scholar Profile

Gerard J Kleywegt)

Google Scholar

George Nemhauser Professor, Georgia Institute of Technology N/A Integer and Combinatorial Optimization WL Nemhauser George N/A Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:ndLnGcHYRF0C Cited by: 12413

An analysis of approximations for maximizing submodular set functions—I GL Nemhauser, LA Wolsey, ML Fisher Mathematical programming 14, 265-294, 1978 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:qjMakFHDy7sC Cited by: 5170

Branch-and-price: Column generation for solving huge integer programs C Barnhart, EL Johnson, GL Nemhauser, MWP Savelsbergh, PH Vance Operations research 46 (3), 316-329, 1998 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:u-x6o8ySG0sC Cited by: 3266

Integer programming RS Garfinkel New York: Wiley,, 1972 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:d1gkVwhDpl0C Cited by: 2158

Exceptional paper—location of bank accounts to optimize float: An analytic study of exact and approximate algorithms G Cornuejols, ML Fisher, GL Nemhauser Management science 23 (8), 789-810, 1977 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:9yKSN-GCB0IC Cited by: 1291

Introduction to dynamic programming GL Nemhauser Wiley, 1967 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:4OULZ7Gr8RgC Cited by: 1141

A model and an algorithm for the dynamic traffic assignment problems DK Merchant, GL Nemhauser Transportation science 12 (3), 183-199, 1978 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:Tyk-4Ss8FVUC Cited by: 984

An analysis of approximations for maximizing submodular set functions—II ML Fisher, GL Nemhauser, LA Wolsey Polyhedral Combinatorics: Dedicated to the memory of DR Fulkerson, 73-87, 1978 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:kNdYIx-mwKoC Cited by: 932

The traveling salesman problem: a survey M Bellmore, GL Nemhauser Operations Research 16 (3), 538-558, 1968 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:zYLM7Y9cAGgC Cited by: 932

The uncapicitated facility location problem G Cornuéjols, G Nemhauser, L Wolsey Cornell University Operations Research and Industrial Engineering, 1983 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:UeHWp8X0CEIC Cited by: 917

Vertex packings: structural properties and algorithms GL Nemhauser, LE Trotter Jr Mathematical Programming 8 (1), 232-248, 1975 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:IjCSPb-OGe4C Cited by: 838

50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, … Springer Science & Business Media, 2009 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:Ade32sEp0pkC Cited by: 822

Best algorithms for approximating the maximum of a submodular set function GL Nemhauser, LA Wolsey Mathematics of operations research 3 (3), 177-188, 1978 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:ZeXyd9-uunAC Cited by: 693

The fleet assignment problem: Solving a large-scale integer program CA Hane, C Barnhart, EL Johnson, RE Marsten, GL Nemhauser, … Mathematical Programming 70, 211-232, 1995 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:Y0pCki6q_DkC Cited by: 654

The sample average approximation method applied to stochastic routing problems: a computational study B Verweij, S Ahmed, AJ Kleywegt, G Nemhauser, A Shapiro Computational optimization and applications 24, 289-333, 2003 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:5nxA0vEk-isC Cited by: 614

Flight string models for aircraft fleeting and routing C Barnhart, NL Boland, LW Clarke, EL Johnson, GL Nemhauser, … Transportation science 32 (3), 208-220, 1998 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:W7OEmFMy1HYC Cited by: 525

Optimality conditions for a dynamic traffic assignment model DK Merchant, GL Nemhauser Transportation Science 12 (3), 200-207, 1978 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:_FxGoFyzp5QC Cited by: 500

Optimization GL Nemhauser, AHGR Kan, MJ Todd Elsevier North-Holland, Inc., 1989 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:vxA22ZmNLkoC Cited by: 483

Optimal political districting by implicit enumeration techniques RS Garfinkel, GL Nemhauser Management Science 16 (8), B-495-B-508, 1970 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:roLk4NBRz8UC Cited by: 459

An algorithm for the line balancing problem AL Gutjahr, GL Nemhauser Management science 11 (2), 308-315, 1964 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:ufrVoPGSRksC Cited by: 447

Co-authors

Laurence Wolsey, ChLWT2oAAAAJ

Martin Savelsbergh k8ReGDoAAAAJ

Shabbir Ahmed 4D9lk0MAAAAJ

marshall fisher oyJEvvYAAAAJ

gerard cornuejols 9lFYMIkAAAAJ

Joel Sokol PYspUysAAAAJ

Juan Pablo Vielma 4y7ebPMAAAAJ

Alper Atamturk NzjKoWIAAAAJ

Michael Trick 6dkoOx8AAAAJ

Michael Todd 7yG8mNQAAAAJ

Wen-Lian Hsu NqkY4tIAAAAJ

Andrew J. Schaefer YE3iwn0AAAAJ

Jay Rosenberger ZgqIhscAAAAJ

Dimitri J. Papageorgiou _KQQtY8AAAAJ

Pierre Le Bodic wQcDC-YAAAAJ

Yufen Shao MWAmYWcAAAAJ

Mike Hewitt 607SgccAAAAJ

Yongpei Guan nOooEyoAAAAJ

Elias B. Khalil juqDWQMAAAAJ

Bistra Dilkina 1jjyaBYAAAAJ

Google Scholar

Integer programming RS Garfinkel New York: Wiley,, 1972 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:d1gkVwhDpl0C Cited by: 2158

Co-authors

Laurence Wolsey, googlescholarauthor_id:ChLWT2oAAAAJ

Martin Savelsbergh googlescholarauthor_id:k8ReGDoAAAAJ

Shabbir Ahmed googlescholarauthor_id:4D9lk0MAAAAJ

marshall fisher googlescholarauthor_id:oyJEvvYAAAAJ

gerard cornuejols googlescholarauthor_id:9lFYMIkAAAAJ

Joel Sokol googlescholarauthor_id:PYspUysAAAAJ

Juan Pablo Vielma googlescholarauthor_id:4y7ebPMAAAAJ

Alper Atamturk googlescholarauthor_id:NzjKoWIAAAAJ

Michael Trick googlescholarauthor_id:6dkoOx8AAAAJ

Michael Todd googlescholarauthor_id:7yG8mNQAAAAJ

Wen-Lian Hsu googlescholarauthor_id:NqkY4tIAAAAJ

Andrew J. Schaefer googlescholarauthor_id:YE3iwn0AAAAJ

Jay Rosenberger googlescholarauthor_id:ZgqIhscAAAAJ

Dimitri J. Papageorgiou googlescholarauthorid:KQQtY8AAAAJ

Pierre Le Bodic googlescholarauthor_id:wQcDC-YAAAAJ

Yufen Shao googlescholarauthor_id:MWAmYWcAAAAJ

Mike Hewitt googlescholarauthor_id:607SgccAAAAJ

Yongpei Guan googlescholarauthor_id:nOooEyoAAAAJ

Elias B. Khalil googlescholarauthor_id:juqDWQMAAAAJ

Bistra Dilkina googlescholarauthor_id:1jjyaBYAAAAJ

Google Scholar

Integer programming RS Garfinkel New York: Wiley,, 1972 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:d1gkVwhDpl0C Cited by: 2158

Co-authors

Laurence Wolsey, googlescholarauthorid laurencewolsey,.md:ChLWT2oAAAAJ

Martin Savelsbergh googlescholarauthorid martinsavelsbergh.md:k8ReGDoAAAAJ

Shabbir Ahmed googlescholarauthorid shabbirahmed.md:4D9lk0MAAAAJ

marshall fisher googlescholarauthorid marshallfisher.md:oyJEvvYAAAAJ

gerard cornuejols googlescholarauthorid gerardcornuejols.md:9lFYMIkAAAAJ

Joel Sokol googlescholarauthorid joelsokol.md:PYspUysAAAAJ

Juan Pablo Vielma googlescholarauthorid juanpablo_vielma.md:4y7ebPMAAAAJ

Alper Atamturk googlescholarauthorid alperatamturk.md:NzjKoWIAAAAJ

Michael Trick googlescholarauthorid michaeltrick.md:6dkoOx8AAAAJ

Michael Todd googlescholarauthorid michaeltodd.md:7yG8mNQAAAAJ

Wen-Lian Hsu googlescholarauthorid wen-lianhsu.md:NqkY4tIAAAAJ

Andrew J. Schaefer googlescholarauthorid andrewj._schaefer.md:YE3iwn0AAAAJ

Jay Rosenberger googlescholarauthorid jayrosenberger.md:ZgqIhscAAAAJ

Dimitri J. Papageorgiou googlescholarauthorid dimitrij.papageorgiou.md:KQQtY8AAAAJ

Pierre Le Bodic googlescholarauthorid pierrele_bodic.md:wQcDC-YAAAAJ

Yufen Shao googlescholarauthorid yufenshao.md:MWAmYWcAAAAJ

Mike Hewitt googlescholarauthorid mikehewitt.md:607SgccAAAAJ

Yongpei Guan googlescholarauthorid yongpeiguan.md:nOooEyoAAAAJ

Elias B. Khalil googlescholarauthorid eliasb._khalil.md:juqDWQMAAAAJ

Bistra Dilkina googlescholarauthorid bistradilkina.md:1jjyaBYAAAAJ

Google Scholar

George Nemhauser

Professor, Georgia Institute of Technology

N/A

Integer and Combinatorial Optimization WL Nemhauser George N/A Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:ndLnGcHYRF0C

Integer programming RS Garfinkel New York: Wiley,, 1972 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:d1gkVwhDpl0C

Introduction to dynamic programming GL Nemhauser Wiley, 1967 Link: https://scholar.google.com/citations?viewop=viewcitation&hl=en&user=BkIva08AAAAJ&citationforview=BkIva08AAAAJ:4OULZ7Gr8RgC