Collette Coullard

Publications

Editorial activities

 

Coullard, C.R., R. Fourer, and J.H. Owen, Editors, "Modeling Languages and Systems," Annals of Operations Research 104 Kluwer Academic Publishers (2001).

 

Publications in refereed journals

 

Berger, R., C. Coullard, and M. Daskin, "Location-Routing Problems with Distance Constraints,” Transportation Science, forthcoming (2006).

 

Ozsen, L., C.Coullard, and M. Daskin, "Capacitated Facility Location Model with Risk Pooling," Naval Research Logistics, under revision (2006).

 

Ozsen, L., C.Coullard, and M. Daskin, “Facility Location Modeling and Inventory Management with Multi-Sourcing,” Transportation Science, under revision (2006).

 

Shen, Z-J.M., C.R. Coullard and M.S. Daskin, "A joint location-inventory model," Transportation Science 37 (1)  (2003) 40-55.

 

Daskin, M.S., C.R. Coullard and Z-J M. Shen, ``An Inventory-Location Model: Formulation, Solution Algorithm, and Computational Results," Annals of Operations Research 110 (2003) 83-106.

 

Coullard, C.R., A.B. Gamble, and P.C. Jones, ``Matching Problems in Selective Assembly Operations,''  Annals of Operations Research , R.E. Burkard, T. Ibaraki, and W.R. Pulleyblank, editors, 76 (1998) 95-107.

 

Coullard, C.R., L.L. Gardner, and D.K. Wagner, ``Minimum-Weight Cycles in 3-Separable Graphs,'' Networks 29 (1997) 151-160.

 

Berger, R.T., C.R. Coullard and M.S. Daskin, ``Modeling and Solving Location-Routing Problems with Time Deadlines,'' Studies in Location Analysis 9 (1996) 15-17.

 

Coullard, C.R., and L. Hellerstein, ``Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory,'' Combinatorica 16 (1996) 1-20.

 

Coullard, C.R., A. Rais, D.K. Wagner, and R.L. Rardin, ``The Dominant of the 2-Connected-Steiner-Subgraph Polytope for W_4-Free Graphs," Discrete Applied Mathematics 66 (1996) 33-43.

 

Coullard, C.R., B. Gamble, and J. Liu, ``The k-Walk Polyhedron,'' in Advances in Optimization and Approximation, D. Du and J. Sun, eds., Kluwer Scientific Publishers, Dordrecht, The Netherlands (1994) 9-29.

 

Coullard, C.R., and Peh Ng, ``A Class of Totally Unimodular Leontief Directed Hypergraphs," Linear Algebra and Its Applications 230 (1995) 101-125..

 

Coullard, C.R., A. Rais, D.K. Wagner, and R.L. Rardin, ``Linear-Time Algorithms for the 2-Connected Steiner Subgraph Problem on Special Classes of Graphs,'' Networks 23 (1993) 195-206.

 

Coullard, C.R., J.G. del Greco, and D.K. Wagner, ``Recognizing a Class of Bicircular Matroids," Discrete Applied Mathematics 43 (1993) 197-215.

 

Coullard, C.R., L.L. Gardner, and D.K. Wagner, ``Decomposition of 3-Connected Graphs," Combinatorica 13 (1993) 7-30.

 

Coullard, C.R., and A. Lubiw, ``Distance Visibility Graphs," International Journal of Computational Geometry and Applications 2 (1991) 349-362.

 

Coullard, C.R., J.G. del Greco, and D.K. Wagner, ``Uncovering Generalized Network Structure in Matrices," Discrete Applied Mathematics 46 (1993) 191-220.

 

Coullard, C.R., and J.G. Oxley, ``Extensions of Tutte's Wheels-and-Whirls Theorem," Journal of Combinatorial Theory, Series B \bf 56\rm, 1992, 130-140.

 

Coullard, C.R., J.G. del Greco, and D.K. Wagner ``Representations of Bicircular Matroids," Discrete Applied Mathematics32 , 1991, 223-240.

 

Chandru, V., C.R. Coullard, P. Hammer, M. Montanez, and X. Sun, ``On Renamable Horn and Generalized Horn Functions," Annals of Mathematics and Artificial Intelligence, 1, 1990, 33-47.

 

Coullard, C.R., and W.R. Pulleyblank, ``On Cycle Cones and Polyhedra," Linear Algebra and Its Applications 114/115, 1989, 613-640.

 

Coullard, C.R., and T.J. Reid, ``Element Subsets of 3-Connected Matroids," Congressus Numerantium, 66, 1988, 81-92.

 

Bixby, R.E., and C.R. Coullard, ``Adjoints of Binary Matroids," European Journal of Combinatorics, 9, 1988.

 

Bixby, R.E., and C.R. Coullard, ``Finding a Small 3-Connected Minor Maintaining a Fixed Minor and a Fixed Element," Combinatorica B3 , 1987, 155-166.

 

Cook, W., Coullard, C.R., and Gy. Turan, ``On the Complexity of Cutting-Plane Proofs," Discrete Applied Mathematics 18, 1987, 25-38.

 

Coullard, C.R., ``Counterexamples to Conjectures on 4-Connected Matroids," Combinatorica B6 (4), 1986, 315-320.

 

Bixby, R.E., and C.R. Coullard, ``On Chains of 3-Connected Matroids," Discrete Applied Mathematics 15, 1986, 155-166.

 

Chandru, V., C.R. Coullard, and D.K. Wagner, ``On the Complexity of Recognizing a Class of Genera lized Networks," Operations Research Letters 4, 1985, 75-78 .

 

Refereed proceedings articles

 

Owen, J.H., C.R. Coullard and D.S. Dilworth, ``GIDEN: A Graphical Environment for Network Optimization,'' Sixth Industrial Engineering Research Conference Proceedings, G.L. Curry, B. Bidanda and S. Jagdale, Eds., Institute of Industrial Engineers, Norcross, GA (1997) 507--512.

 

Hesse, S.M., C.R. Coullard, M.S. Daskin and A.P. Hurter, ``A Case Study in Platelet Inventory Management,'' Sixth Industrial Engineering Research Conference Proceedings, G.L. Curry, B. Bidanda and S. Jagdale, Eds., Institute of Industrial Engineers, Norcross, GA (1997) 801--806.

 

Coullard, C. and R. Fourer, ``Algebraic, Logical and network Representations in the Design of Software for Combinatorial Optimization," in the Proceedings of the 29th Annual Hawaii International Conference on System Sciences (1996) 407--416.

 

Hellerstein, L., and C.R. Coullard, ``Learning Binary Matroid Ports,'' in the Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994) 328-335.

 

Coullard, C.R., and D.K. Wagner, ``Decomposing 3-Connected Graphs,'' Graph Structure Theory: Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, N. Robertson and P. Seymour, editors, American Mathematical Society, 1993, 631-633.

 

Coullard, C.R., and A. Lubiw, ``Distance Visibility Graphs," 1990, Proceedings of the 1991 Symposium on Computational Geometry .

 

Technical reports

M. Terwilliger, A. Gupta, C. Coullard, "Coverage with Confidence in Wireless Sensor Networks", Technical Report TR/06-01, Department of Computer Science, Western Michigan University, January 2006.

M. Terwilliger, C. Coullard, A. Gupta, "Localization with Confidence in Wireless Sensor Networks", Technical Report TR/05-09, Department of Computer Science, Western Michigan University, November 2005.

M. Terwilliger, C. Coullard, A. Gupta, "On Bounding the Localization Errors", Technical Report TR/05-07, Department of Computer Science, Western Michigan University, September 2005.

C.R. Coullard, “The structure of optimal solutions to the submodular function minimization problem,” TR 1928, Institute for Mathematics and its Applications, University of Minnesota, June 2003).

Bixby, A.E., C.R. Coullard and D. Simchi-Levi, ``The Capacitated Prize-Collecting Traveling Salesman Problem,'' Department of Industrial Engineering and Management Sciences, Northwestern University, Technical Report TR96-10, (1996).

 

Dilworth, D., C. Coullard, and J. Owen, ``Graph and Related Data Structures User's Guide,'' Department of Industrial Engineering and Management Sciences, Northwestern University, Technical Report TR96-09, (1996).

 

Coullard, C.R., and J. Oxley, ``A Note on Kahn's Proof of Unique Representability of Matroids over GF[4],'' Technical Report, 1994.

 

Tardif, V., M. Spearman, C.R. Coullard, and W. Hopp, ``A Framework for Material Requirements Planning,'' 1993, Department of Industrial Engineering and Management Sciences, Northwestern University, Technical Report 93-02.

 

Coullard, C.R., A. Rais, D.K. Wagner, and R.L. Rardin, ``The 2-Connected-Steiner-Subgraph Polytope for Series-Parallel Graphs," Report No. CC-91-32, Purdue University, 1991.

 

Coullard, C.R., A. Rais, D.K. Wagner, and R.L. Rardin, ``The 2-Connected-Spanning-Subgraph Polytope for Series-Parallel Graphs," Report No. CC-90-18, Purdue University, 1990.

 

Software

 

Co-developer, with D. Dilworth and J. Owen, of GIDEN:  A Graphical Implementation Development Environment for Networks.  This software package is written in Java and includes a graphical network editor, a library of efficient network data structures, and an extendable library of animated network optimization algorithms.  This package is used for teaching network optimization algorithms and for implementing prototypes of experimental algorithms.  Supported by grants from the Office of Naval Research, the National Science Foundation, and the Committee on Institutional Cooperation.