#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1985

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marvin D. Nelson, Kendall E. Nygard, John H. Griffin, Warren E. Shreve
- Computers & OR
- 1985

Six methods for implementing the widely used Clarke-Wright algorithm for the vehicle routing problem (VRP) are presented and compared. Fifty-five large test problems are used to compare the methods. The methods involve alternative ways to access adjacency information in both low and high density problems. The results clearly establish methods of choice for… (More)

- WARREN E. SHREVE
- 2010

A result of Ladas; Lakshmikantham, and Papadakis [1] concerning oscillation caused by lag in linear first order retarded argument differential equations is generalized to the sublinear case. Examples showing that such generalization to the superlinear case is impossible are given. 0. Introduction. It is known ([1], for example) that (A) g e C(R, R), g(t) <… (More)

- Guantao Chen, Richard H. Schelp, Warren E. Shreve
- Eur. J. Comb.
- 1997

- Guantao Chen, Joan P. Hutchinson, Wiktor Piotrowski, Warren E. Shreve, Bing Wei
- Ars Comb.
- 2001

A given nonincreasing sequence D = (d1, d2, · · · , dn) is said to contain a (nonincreasing) repetition sequence D∗ = (di1 , di2 , · · · , dik ) for some k ≤ n − 2 if all values of D −D∗ are distinct and for any dil ∈ D ∗ there exists some dt ∈ D −D∗ such that dil = dt. For any pair of integers n and k with n ≥ k + 2, we investigate the existence of a… (More)

- Guantao Chen, Wiktor Piotrowski, Warren E. Shreve
- Journal of Graph Theory
- 1996

- Xiaotao Cai, Warren E. Shreve
- Discrete Mathematics
- 2001

For any natural number k, a graph G is said to be pancyclic mod k if it contains a cycle of every length modulo k. In this paper, we show that every K1,4-free graph G with minimum degree δ(G) ≥ k+ 3 is pancyclic mod k and every claw-free graph G with δ(G) ≥ k+ 1 is pancyclic mod k, which confirms Thomassen’s conjecture [8] for claw-free graphs.

- Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve
- Journal of Graph Theory
- 1998

- Guantao Chen, Ralph J. Faudree, Warren E. Shreve
- Ars Comb.
- 2001

In this paper, we investigate the sufficient conditions for a graph to contain a cycle (path) C such that G − V (C) is a disjoint union of cliques. In particular, sufficient conditions involving degree sum and neighborhood union are obtained.

- Guantao Chen, Ralph J. Faudree, Warren E. Shreve
- Ars Comb.
- 1998

- Guantao Chen, Warren E. Shreve, Bing Wei
- Journal of Graph Theory
- 2006