Edward J. Anderson

Orcid: 0000-0002-6375-4067

Affiliations:
  • University of Sydney Business School, Australia
  • University of Cambridge, UK (former)


According to our database1, Edward J. Anderson authored at least 54 papers between 1981 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Minimax decision rules for planning under uncertainty: Drawbacks and remedies.
Eur. J. Oper. Res., December, 2023

2022
Improving Sample Average Approximation Using Distributional Robustness.
INFORMS J. Optim., January, 2022

Capacity Games with Supply Function Competition.
Oper. Res., 2022

2020
When can we improve on sample average approximation for stochastic optimization?
Oper. Res. Lett., 2020

Varying confidence levels for CVaR risk measures and minimax limits.
Math. Program., 2020

Achieving Efficiency in Capacity Procurement.
Found. Trends Technol. Inf. Oper. Manag., 2020

Buyer's optimal information revelation strategy in procurement auctions.
Eur. J. Oper. Res., 2020

2019
Forward Commodity Trading with Private Information.
Oper. Res., 2019

Contract design in agriculture supply chains with random yield.
Eur. J. Oper. Res., 2019

2018
Price instability in multi-unit auctions.
J. Econ. Theory, 2018

2017
Algorithm 978: Safe Scaling in the Level 1 BLAS.
ACM Trans. Math. Softw., 2017

Supplier Competition with Option Contracts for Discrete Blocks of Capacity.
Oper. Res., 2017

2016
Preface to the Special Issue on Information and Decisions in Social and Economic Networks.
Oper. Res., 2016

2014
Competition through capacity investment under asymmetric existing capacities and costs.
Eur. J. Oper. Res., 2014

2013
On the existence of supply function equilibria.
Math. Program., 2013

2012
Asymmetric Supply Function Equilibria with Forward Contracts.
J. Optim. Theory Appl., 2012

Ranking Games and Gambling: When to Quit When You're Ahead.
Oper. Res., 2012

2011
Implicit collusion and individual market power in electricity markets.
Eur. J. Oper. Res., 2011

A new model for cycles in retail petrol prices.
Eur. J. Oper. Res., 2011

2010
Price competition with integrated and decentralized supply chains.
Eur. J. Oper. Res., 2010

2009
Modeling Implicit Collusion Using Coevolution.
Oper. Res., 2009

2008
Finding Supply Function Equilibria with Asymmetric Firms.
Oper. Res., 2008

2007
Modelling the effects of interconnection between electricity markets subject to uncertainty.
Math. Methods Oper. Res., 2007

Erratum - A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network.
Manag. Sci., 2007

2006
Optimal Supply Functions in Electricity Markets with Option Contracts and Non-smooth Costs.
Math. Methods Oper. Res., 2006

A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network.
Manag. Sci., 2006

2005
epsilon-Optimal Bidding in an Electricity Market with Discontinuous Market Distribution Function.
SIAM J. Control. Optim., 2005

2004
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time.
Math. Oper. Res., 2004

Nash equilibria in electricity markets with discrete prices.
Math. Methods Oper. Res., 2004

2003
Estimation of Electricity Market Distribution Functions.
Ann. Oper. Res., 2003

A co-evolutionary approach to the tacit collusion of generators in oligopolistic electricity markets: piecewise linear bidding structure case.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002
Necessary and Sufficient Conditions for Optimal Offers in Electricity Markets.
SIAM J. Control. Optim., 2002

Optimal Offer Construction in Electricity Markets.
Math. Oper. Res., 2002

Markov chain modelling of the solution surface in local search.
J. Oper. Res. Soc., 2002

Using Supply Functions for Offering Generation into an Electricity Market.
Oper. Res., 2002

On-line scheduling of a single machine to minimize total weighted completion time.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
A Direct Search Algorithm for Optimization with Noisy Function Evaluations.
SIAM J. Optim., 2001

Simplex-Like Trajectories on Quasi-Polyhedral Sets.
Math. Oper. Res., 2001

Two Dimensional Rendezvous Search.
Oper. Res., 2001

1998
Asymmetric Rendezvous on the Plane.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1996
Purification for separated continuous linear programs.
Math. Methods Oper. Res., 1996

1994
Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem.
INFORMS J. Comput., 1994

1990
The search game on a network with immobile hider.
Networks, 1990

Testing Feasibility in a Lot Scheduling Problem.
Oper. Res., 1990

A Genetic Algorithm for the Assembly Line Balancing Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
A continuous-time network simplex algorithm.
Networks, 1989

An extension of the simplex algorithm for semi-infinite linear programming.
Math. Program., 1989

Solving Sparse Triangular Linear Systems on Parallel Computers.
Int. J. High Speed Comput., 1989

Parallel Genetic Algorithms in Optimization.
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989

1987
Preconditioned Conjugate Gradient Methods for General Sparse Matrices on Shared Memory Machines.
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

1984
Duality and an Algorithm for a Class of Continuous Transportation Problems.
Math. Oper. Res., 1984

1983
Erratum.
Math. Oper. Res., 1983

1982
A Class of Continuous Network Flow Problems.
Math. Oper. Res., 1982

1981
Mazes: Search games on unknown networks.
Networks, 1981


  Loading...