Working Papers and Publications (more to come):

For copies of any of the papers listed here please contact me.

Network Design

• A Note on Search by Objective Relaxation (with D. Stanojevic). Chapter 10, pp 181-201, in Telecommunications Planning: Innovations in Pricing, Network Design and Management. Springer, 2006.
• Heuristic Search for Network Design (with I. Gamvros, B. Golden, and D. Stanojevic). In Tutorials on Emerging Methodologies and Applications in Operations Research, edited by Harvey Greenberg (Springer) 2005. View our tutorial presentation at INFORMS, Denver, 2004.
• The Multi-Level Capacitated Minimum Spanning Tree Problem (with I. Gamvros and B.Golden). To appear INFORMS Journal on Computing.
• Heuristic Search for the Generalized Minimum Spanning Tree Problem (with B.Golden and D.Stanojevic). INFORMS Journal on Computing, 17(3), pp 290-304, 2005.
• Twinless Strongly Connected Components. Submitted for publication.
• A Note on Eswaran and Tarjan’s Algorithm for the Strong Connectivity Augmentation Problem. pp 19-26, in The Next Wave in Computing, Optimization, and Decision Technologies, edited by Golden, Raghavan, and Wasil (Springer) 2005.
• Long Distance Access Network Design (with R. Berger). Management Science, 50(3), pp 309-325, 2004 (awarded 2nd place in the inaugural INFORMS Junior Faculty paper competition).
• Low-Connectivity Network Design on Series-Parallel Graphs.  Networks 43(3), pp 163-176, 2004. Proof figures.
• Strong Formulations for Network Design Problems with Connectivity Requirements, (with T.L.Magnanti). Networks 45(2), pp 61-79, 2005.
• An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree problem. (with Ioannis Gamvros and Bruce Golden) in Telecommunications Network Design and Management, edited by Anandalingam and Raghavan (Kluwer Academic Press) 2003.
• Bicriteria Product Design Optimization, (with M.Ball and V.Trichur). Naval Research Logistics, 49(6), pp 574-592, 2002.
• Tabu Search for a Network Loading Problem with Multiple Facilities, (with D.Berger, B.Gendron, J.Y.Potvin and P.Soriano). Journal of Heuristics 6(2), pp 253-267, 2000.
• Network Connectivity, (with T. L. Magnanti). In Annotated Bibliographies in Combinatorial Optimization, edited by M. Dell’Amico, F. Maffioli and S. Martello (John Wiley & Sons) 1997.

Auctions

• A Combinatorial Procurement Auction featuring Bundle Price Revelation without Free Riding (with R. Day). Submitted for publication.
• Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions (with R. Day). Submitted for publication.
• The Landscape of Electronic Market Design (with G. Anandalingam and R. Day). Management Science, 51(3), pp 316-327, 2005.
• CAMBO: Combinatorial Auctions using Matrix Bids with Order (with R.Day). Submitted for publication.

Data Mining

• A Divide-and-Conquer Local Search Heuristic for Data Visualization (with R.Abbiw-Jackson, B.Golden and E.Wasil). To appear in Computers & Operations Research.
• Diversification for Smarter Trees (with Z.Fu, B.Golden, S.Lele and E.Wasil). To appear in Computers & Operations Research.
• Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees (with Z.Fu, B.Golden, S.Lele and E.Wasil). Operations Research, 51(6). pp 894-907. 2003.
• A Genetic Algorithm-based Approach for Building Accurate Decision Trees (with Z.Fu, B.Golden, S.Lele and E.Wasil). INFORMS Journal on Computing 15(1), pp 3-22, 2003.
• A Visualization Model Based on Adjacency Data. (with E. Condon, B.Golden, S.Lele and E.Wasil). Decision Support Systems, 33(4), pp 349-362, 2002.