default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward J. Anderson
Person information
- affiliation: University of Sydney Business School, Australia
- affiliation (former): University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j48]Edward J. Anderson
, Stan Zachary:
Minimax decision rules for planning under uncertainty: Drawbacks and remedies. Eur. J. Oper. Res. 311(2): 789-800 (2023)- 2022
- [j47]Edward J. Anderson, Andy Philpott:
Improving Sample Average Approximation Using Distributional Robustness. INFORMS J. Optim. 4(1): 90-124 (2022) - [j46]Edward J. Anderson, Bo Chen, Lusheng Shao:
Capacity Games with Supply Function Competition. Oper. Res. 70(4): 1969-1983 (2022) - 2020
- [j45]Cheng Qian, Edward J. Anderson:
Buyer's optimal information revelation strategy in procurement auctions. Eur. J. Oper. Res. 283(3): 1011-1025 (2020) - [j44]Lusheng Shao, Edward J. Anderson, Bo Chen:
Achieving Efficiency in Capacity Procurement. Found. Trends Technol. Inf. Oper. Manag. 14(1-2): 138-154 (2020) - [j43]Edward J. Anderson, Huifu Xu, Dali Zhang:
Varying confidence levels for CVaR risk measures and minimax limits. Math. Program. 180(1): 327-370 (2020) - [j42]Edward J. Anderson, Harrison Nguyen:
When can we improve on sample average approximation for stochastic optimization? Oper. Res. Lett. 48(5): 566-572 (2020)
2010 – 2019
- 2019
- [j41]Edward J. Anderson, Marta Monjardino:
Contract design in agriculture supply chains with random yield. Eur. J. Oper. Res. 277(3): 1072-1082 (2019) - [j40]Edward J. Anderson, Andrew B. Philpott:
Forward Commodity Trading with Private Information. Oper. Res. 67(1): 58-71 (2019) - [i3]Edward J. Anderson, Bo Chen, Lusheng Shao:
Capacity Games with Supply Function Competition. CoRR abs/1905.11084 (2019) - [i2]Eddie Anderson, Harrison Nguyen:
When can we improve on sample average approximation for stochastic optimization? CoRR abs/1907.08334 (2019) - 2018
- [j39]Edward J. Anderson, Pär Holmberg:
Price instability in multi-unit auctions. J. Econ. Theory 175: 318-341 (2018) - 2017
- [j38]Edward J. Anderson, Bo Chen, Lusheng Shao:
Supplier Competition with Option Contracts for Discrete Blocks of Capacity. Oper. Res. 65(4): 952-967 (2017) - [j37]Edward J. Anderson:
Algorithm 978: Safe Scaling in the Level 1 BLAS. ACM Trans. Math. Softw. 44(1): 12:1-12:28 (2017) - 2016
- [j36]Edward J. Anderson, David Gamarnik, Anton J. Kleywegt, Asuman E. Ozdaglar:
Preface to the Special Issue on Information and Decisions in Social and Economic Networks. Oper. Res. 64(3): 561-563 (2016) - 2014
- [j35]Shu-Jung Sunny Yang, Edward James Anderson:
Competition through capacity investment under asymmetric existing capacities and costs. Eur. J. Oper. Res. 237(1): 217-230 (2014) - 2013
- [j34]Edward J. Anderson:
On the existence of supply function equilibria. Math. Program. 140(2): 323-349 (2013) - 2012
- [j33]Edward J. Anderson:
Ranking Games and Gambling: When to Quit When You're Ahead. Oper. Res. 60(5): 1229-1244 (2012) - [j32]Edward J. Anderson, Xinmin Hu:
Asymmetric Supply Function Equilibria with Forward Contracts. J. Optim. Theory Appl. 152(1): 198-224 (2012) - 2011
- [j31]Edward J. Anderson:
A new model for cycles in retail petrol prices. Eur. J. Oper. Res. 210(2): 436-447 (2011) - [j30]Edward J. Anderson, T. D. H. Cau:
Implicit collusion and individual market power in electricity markets. Eur. J. Oper. Res. 211(2): 403-414 (2011) - 2010
- [j29]Edward J. Anderson, Yong Bao:
Price competition with integrated and decentralized supply chains. Eur. J. Oper. Res. 200(1): 227-234 (2010)
2000 – 2009
- 2009
- [j28]Edward J. Anderson, T. D. H. Cau:
Modeling Implicit Collusion Using Coevolution. Oper. Res. 57(2): 439-455 (2009) - 2008
- [j27]Edward J. Anderson, Xinmin Hu:
Finding Supply Function Equilibria with Asymmetric Firms. Oper. Res. 56(3): 697-711 (2008) - 2007
- [j26]Edward J. Anderson, Frank Kelly, Richard Steinberg, Robert Waters:
Erratum - A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network. Manag. Sci. 53(6): 1029-1031 (2007) - [j25]Edward J. Anderson, Andrew B. Philpott, Huifu Xu:
Modelling the effects of interconnection between electricity markets subject to uncertainty. Math. Methods Oper. Res. 65(1): 1-26 (2007) - 2006
- [j24]Edward J. Anderson, Frank Kelly, Richard Steinberg:
A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network. Manag. Sci. 52(1): 39-53 (2006) - [j23]Edward J. Anderson, Huifu Xu:
Optimal Supply Functions in Electricity Markets with Option Contracts and Non-smooth Costs. Math. Methods Oper. Res. 63(3): 387-411 (2006) - 2005
- [j22]Edward J. Anderson, Huifu Xu:
epsilon-Optimal Bidding in an Electricity Market with Discontinuous Market Distribution Function. SIAM J. Control. Optim. 44(4): 1391-1418 (2005) - [i1]Edward J. Anderson, Frank Kelly, Richard Steinberg:
A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network. Computing and Markets 2005 - 2004
- [j21]Edward J. Anderson, Huifu Xu:
Nash equilibria in electricity markets with discrete prices. Math. Methods Oper. Res. 60(2): 215-238 (2004) - [j20]Edward J. Anderson, Chris N. Potts:
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time. Math. Oper. Res. 29(3): 686-697 (2004) - 2003
- [j19]Edward J. Anderson, Andrew B. Philpott:
Estimation of Electricity Market Distribution Functions. Ann. Oper. Res. 121(1-4): 21-32 (2003) - [c6]T. D. H. Cau, Edward J. Anderson:
A co-evolutionary approach to the tacit collusion of generators in oligopolistic electricity markets: piecewise linear bidding structure case. IEEE Congress on Evolutionary Computation 2003: 2306-2313 - 2002
- [j18]Edward J. Anderson, Andrew B. Philpott:
Using Supply Functions for Offering Generation into an Electricity Market. Oper. Res. 50(3): 477-489 (2002) - [j17]Edward J. Anderson:
Markov chain modelling of the solution surface in local search. J. Oper. Res. Soc. 53(6): 630-636 (2002) - [j16]Edward J. Anderson, Andrew B. Philpott:
Optimal Offer Construction in Electricity Markets. Math. Oper. Res. 27(1): 82-100 (2002) - [j15]Edward J. Anderson, Huifu Xu:
Necessary and Sufficient Conditions for Optimal Offers in Electricity Markets. SIAM J. Control. Optim. 41(4): 1212-1228 (2002) - [c5]Edward J. Anderson, Chris N. Potts:
On-line scheduling of a single machine to minimize total weighted completion time. SODA 2002: 548-557 - 2001
- [j14]Edward J. Anderson, Sándor P. Fekete:
Two Dimensional Rendezvous Search. Oper. Res. 49(1): 107-118 (2001) - [j13]Edward J. Anderson, Miguel A. Goberna, Marco A. López:
Simplex-Like Trajectories on Quasi-Polyhedral Sets. Math. Oper. Res. 26(1): 147-162 (2001) - [j12]Edward J. Anderson, Michael C. Ferris:
A Direct Search Algorithm for Optimization with Noisy Function Evaluations. SIAM J. Optim. 11(3): 837-857 (2001)
1990 – 1999
- 1998
- [c4]Edward J. Anderson, Sándor P. Fekete:
Asymmetric Rendezvous on the Plane. SCG 1998: 365-373 - 1996
- [j11]Edward J. Anderson, Malcolm Craig Pullan:
Purification for separated continuous linear programs. Math. Methods Oper. Res. 43(1): 9-33 (1996) - 1994
- [j10]Edward J. Anderson, Michael C. Ferris:
Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem. INFORMS J. Comput. 6(2): 161-173 (1994) - 1990
- [j9]Edward J. Anderson:
Testing Feasibility in a Lot Scheduling Problem. Oper. Res. 38(6): 1079-1088 (1990) - [j8]Edward J. Anderson, M. A. Aramendia:
The search game on a network with immobile hider. Networks 20(7): 817-844 (1990) - [c3]Edward J. Anderson, Michael C. Ferris:
A Genetic Algorithm for the Assembly Line Balancing Problem. IPCO 1990: 7-18
1980 – 1989
- 1989
- [j7]Edward J. Anderson, Yousef Saad:
Solving Sparse Triangular Linear Systems on Parallel Computers. Int. J. High Speed Comput. 1(1): 73-95 (1989) - [j6]Edward J. Anderson, Adrian S. Lewis:
An extension of the simplex algorithm for semi-infinite linear programming. Math. Program. 44(1-3): 247-269 (1989) - [j5]Edward J. Anderson, Andrew B. Philpott:
A continuous-time network simplex algorithm. Networks 19(4): 395-425 (1989) - [c2]Edward J. Anderson, Michael C. Ferris:
Parallel Genetic Algorithms in Optimization. PP 1989: 137-142 - 1987
- [c1]Edward J. Anderson, Yousef Saad:
Preconditioned Conjugate Gradient Methods for General Sparse Matrices on Shared Memory Machines. PP 1987: 88-92 - 1984
- [j4]Edward J. Anderson, Andrew B. Philpott:
Duality and an Algorithm for a Class of Continuous Transportation Problems. Math. Oper. Res. 9(2): 222-231 (1984) - 1983
- [j3]Edward J. Anderson, P. Nash, Andrew B. Philpott:
Erratum. Math. Oper. Res. 8(3): 478 (1983) - 1982
- [j2]Edward J. Anderson, P. Nash, Andrew B. Philpott:
A Class of Continuous Network Flow Problems. Math. Oper. Res. 7(4): 501-514 (1982) - 1981
- [j1]Edward J. Anderson:
Mazes: Search games on unknown networks. Networks 11(4): 393-397 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
