G. Anandalingam - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2008

Customized Bundle Pricing for Information Goods: A Nonlinear Mixed-Integer Programming ApproachShin-yi Wu, Lorin M. Hitt, Pei-Yu Sharon Chen, G. Anandalingam. mansci, 54(3):608-622, 2008. [doi]

2005

The Winner s Curse in High TechG. Anandalingam, Henry C. Lucas Jr.. Computer, 38(3):96-97, 2005. [doi]

Introduction to the Special Issue on Electronic MarketsG. Anandalingam, S. Raghavan. mansci, 51(3):315, 2005.

The Landscape of Electronic Market DesignG. Anandalingam, Robert W. Day, S. Raghavan. mansci, 51(3):316-327, 2005. [doi]

A New Pricing Model for Competitive Telecommunications Services Using Congestion DiscountsNeil J. Keon, G. Anandalingam. informs, 17(2):248-262, 2005. [doi]

Iterative Combinatorial Auctions with Bidder-Determined CombinationsR. H. Kwon, G. Anandalingam, L. H. Ungar. mansci, 51(3):407-418, 2005. [doi]

2003

Optimal pricing for multiple services in telecommunications networks offering quality-of-service guaranteesNeil J. Keon, G. Anandalingam. ton, 11(1):66-80, 2003. [doi]

Fighting Information Good Piracy with VersioningShin-yi Wu, Pei-Yu Sharon Chen, G. Anandalingam. icisc 2003: 617-629

An expert system to physician-detailing planningJohn C. Yi, G. Anandalingam, Levi A. Sorrell. eswa, 25(4):533-544, 2003. [doi]

2001

Siting noxious facilities under uncertaintyK. A. Killmer, G. Anandalingam, S. A. Malcolm. eor, 133(3):596-607, 2001. [doi]

2000

A genetic algorithm approach to policy design for consequence minimizationBonnie Rubenstein-Montano, G. Anandalingam, Iraj Zandi. eor, 124(1):43-54, 2000. [doi]

1999

Formulating and solving production planning problemsLarry J. Leblanc, Avraham Shtub, G. Anandalingam. eor, 112(1):54-80, 1999. [doi]

1996

An integrated system for designing minimum cost survivable telecommunications networksLloyd W. Clarke, G. Anandalingam. tsmc, 26(6):856-862, 1996. [doi]

1995

A bootstrap heuristic for designing minimum cost survivable networksLloyd W. Clarke, G. Anandalingam. cor, 22(9):921-934, 1995. [doi]

1993

A penalty function approach to alternative pairwise comparisons in ISMAUTG. Anandalingam, Chelsea C. White III. tsmc, 23(1):330-333, 1993. [doi]

A penalty function approach for solving bi-level linear programsD. J. White, G. Anandalingam. jgo, 3(4):397-419, 1993. [doi]

1992

1991

Combination and selection of binary forecastsG. Anandalingam, Lian Chen. tsmc, 21(4):750-757, 1991. [doi]

Optimizing Interconnections of Local Area Networks: An Approach Using Simulated AnnealingPeter C. Fetterolf, G. Anandalingam. informs, 3(4):275-287, 1991. [doi]

1990

Optimization of resource location in hierarchical computer networksAshok Vernekar, G. Anandalingam, C. N. Dorny. cor, 17(4):375-388, 1990. [doi]

1989

Simulated annealing and resource location in computer networksG. Anandalingam. wsc 1989: 980-988 [doi]

A multiagent multiattribute approach for conflict resolution in acid rain impact mitigationG. Anandalingam. tsmc, 19(5):1142-1153, 1989. [doi]

1987

A stochastic programming process model for investment planningG. Anandalingam. cor, 14(6):521-536, 1987. [doi]

Stackelberg Games and Multisectoral Economic PlanningG. Anandalingam. tsmc, 17(4):670-676, 1987. [doi]

1986

Traffic signal timing at isolated intersections using simulation optimizationAnthony A. Saka, G. Anandalingam, Nicholas J. Garber. wsc 1986: 795-801 [doi]

Sign in or sign up to see more results.

runs on WebDSL