Anton J. Kleywegt

According to our database1, Anton J. Kleywegt authored at least 27 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Data-driven optimization in management.
Comput. Manag. Sci., 2019

2017
When Friends Become Competitors: The Design of Resource Exchange Alliances.
Manag. Sci., 2017

Wasserstein Distributional Robustness and Regularization in Statistical Learning.
CoRR, 2017

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

2015
Learning and Pricing with Models That Do Not Explicitly Incorporate Competition.
Oper. Res., 2015

2014
A Comparative Study of Procedures for the Multinomial Selection Problem.
Proceedings of the Essays in Production, 2014

2012
Newsvendor-type models with decision-dependent uncertainty.
Math. Methods Oper. Res., 2012

2009
A Network Design Problem.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2006
Models of the Spiral-Down Effect in Revenue Management.
Oper. Res., 2006

The Power of Sequential Single-Item Auctions for Agent Coordination.
Proceedings of the Proceedings, 2006

2005
Airline Crew Scheduling Under Uncertainty.
Transp. Sci., 2005

A computer simulation model of container movement by sea.
Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, 2005

Auction-Based Multi-Robot Routing.
Proceedings of the Robotics: Science and Systems I, 2005

2004
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem.
Transp. Sci., 2004

Simple auctions with performance guarantees for multi-robot task allocation.
Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, September 28, 2004

2003
Optimal Online Algorithms for Minimax Resource Scheduling.
SIAM J. Discret. Math., 2003

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study.
Comput. Optim. Appl., 2003

Robot exploration with combinatorial auctions.
Proceedings of the 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, Nevada, USA, October 27, 2003

2002
A Stochastic Model of Airline Operations.
Transp. Sci., 2002

The Stochastic Inventory Routing Problem with Direct Deliveries.
Transp. Sci., 2002

The Sample Average Approximation Method for Stochastic Discrete Optimization.
SIAM J. Optim., 2002

Minimax analysis of stochastic problems.
Optim. Methods Softw., 2002

2001
The Dynamic and Stochastic Knapsack Problem with Random Sized Items.
Oper. Res., 2001

2000
Air transportation simulation: SimAir: a stochastic model of airline operations.
Proceedings of the 32nd conference on Winter simulation, WSC 2000, 2000

1999
Online Resource Minimization.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Acceptance and Dispatching Policies for a Distribution Problem.
Transp. Sci., 1998

The Dynamic and Stochastic Knapsack Problem.
Oper. Res., 1998


  Loading...