#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1964

2017

- This year (2)
- Last 5 years (21)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Aharon Ben-Tal, Laurent El Ghaoui, +14 authors R May
- 2004

We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than the classical robust framework. We cover a broad range of mathematicalâ€¦ (More)

- David Applegate, William J. Cook
- INFORMS Journal on Computing
- 1991

- William J. Cook, Ravi Kannan, Alexander Schrijver
- Math. Program.
- 1990

Chvfital introduced the idea of viewing cutting planes as a system for proving that every integral solution of a given set of linear inequalities satisfies another given linear inequality. Thisâ€¦ (More)

Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of theâ€¦ (More)

- William J. Cook, Paul D. Seymour
- INFORMS Journal on Computing
- 2003

- David Applegate, William J. Cook, AndrÃ© Rohe
- INFORMS Journal on Computing
- 2003

We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results areâ€¦ (More)

- Senadhi Vijay-Kumar, Charles E Bugg, William J. Cook
- Journal of molecular biology
- 1987

The crystal structure of human erythrocytic ubiquitin has been refined at 1.8 A resolution using a restrained least-squares procedure. The crystallographic R-factor for the final model is 0.176. Bondâ€¦ (More)

- David Applegate, Robert E. Bixby, Vasek ChvÃ¡tal, William J. Cook
- Computational Combinatorial Optimization
- 2001

The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cuttingâ€¦ (More)

- William J. Cook, AndrÃ© Rohe
- INFORMS Journal on Computing
- 1999

We make several observations on the implementation of Edmondsâ€™ blossom algorithm for solving minimum-weight perfectmatching problems and we present computational results for geometric problemâ€¦ (More)

- Y. Srinivasa Kishore Babu, Charles E Bugg, William J. Cook
- Journal of molecular biology
- 1988

The crystal structure of mammalian calmodulin has been refined at 2.2 A (1 A = 0.1 nm) resolution using a restrained least-squares method. The final crystallographic R-factor, based on 6685â€¦ (More)