Collette R. Coullard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2009

Facility Location Modeling and Inventory Management with MultisourcingLeyla Ozsen, Mark S. Daskin, Collette R. Coullard. transci, 43(4):455-472, 2009. [doi]

2008

Localization in Ad Hoc and Sensor Wireless Networks with Bounded ErrorsMark Terwilliger, Collette R. Coullard, Ajay K. Gupta. hipc 2008: 295-308 [doi]

2007

Location-Routing Problems with Distance ConstraintsRosemary T. Berger, Collette R. Coullard, Mark S. Daskin. transci, 41(1):29-43, 2007. [doi]

2003

A Joint Location - Inventory ModelZuo-Jun Max Shen, Collette R. Coullard, Mark S. Daskin. transci, 37(1):40-55, 2003. [doi]

2002

An Inventory-Location Model: Formulation, Solution Algorithm and Computational ResultsMark S. Daskin, Collette R. Coullard, Zuo-Jun Max Shen. anor, 110(1-4):83-106, 2002. [doi]

2001

PrefaceCollette R. Coullard, Robert Fourer, Jonathan H. Owen. anor, 104(1-4):13-14, 2001. [doi]

1998

Matching problems in selective assembly operationsCollette R. Coullard, A. B. Gamble, P. C. Jones. anor, 76:95-107, 1998. [doi]

1997

Minimum-weight cycles in 3-separable graphsCollette R. Coullard, L. Leslie Gardner, Donald K. Wagner. networks, 29(3):151-160, 1997. [doi]

1996

Algebraic, Logical and Network Representations in the Design of Software for Combinatorial OptimizationCollette R. Coullard, Robert Fourer. hicss 1996: 407-416 [doi]

The Dominant of the 2-connected-Steiner-subgraph Polytope for W::4::-free GraphsCollette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner. DAM, 66(1):33-43, 1996. [doi]

Independence and Port Oracles for Matroids, with an Application to Computational Learning TheoryCollette R. Coullard, Lisa Hellerstein. combinatorica, 16(2):189-208, 1996.

1994

Learning Binary Matroid PortsLisa Hellerstein, Collette R. Coullard. soda 1994: 328-335

1993

1992

Extensions of Tutte s wheels-and-whirls theoremCollette R. Coullard, James G. Oxley. JCT, 56(1):130-140, 1992. [doi]

Distance visibility graphsCollette R. Coullard, Anna Lubiw. ijcga, 2(4):349-362, 1992.

1991

Decomposing 3-connected graphsCollette R. Coullard, Donald K. Wagner. gst 1993: 631-634

Representations of bicircular matroidsCollette R. Coullard, John G. Del Greco, Donald K. Wagner. DAM, 32(3):223-240, 1991. [doi]

Distance Visibility GraphsCollette R. Coullard, Anna Lubiw. compgeom 1991: 289-296 [doi]

1990

On Renamable Horn and Generalized Horn FunctionsV. Chandru, Collette R. Coullard, Peter L. Hammer, M. Montanuz, X. Sun. AMAI, 1:33-47, 1990.

1988

Adjoints of Binary MatroidsRobert E. Bixby, Collette R. Coullard. ejc, 9(2):139-147, 1988. [doi]

1987

Finding a small 3-connected minor maintaining a fixed minor and a fixed elementRobert E. Bixby, Collette R. Coullard. combinatorica, 7(3):231-242, 1987.

On the complexity of cutting-plane proofsWilliam Cook, Collette R. Coullard, György Turán. DAM, 18(1):25-38, 1987. [doi]

1986

On chains of 3-connected matroidsRobert E. Bixby, Collette R. Coullard. DAM, 15(2-3):155-166, 1986. [doi]

Counterexamples to conjectures on 4-connected matroidsCollette R. Coullard. combinatorica, 6(4):315-320, 1986.

Sign in or sign up to see more results.

runs on WebDSL