Albert P. M. Wagelmans

Affiliations:
  • Erasmus University Rotterdam, Econometric Institute, Netherlands


According to our database1, Albert P. M. Wagelmans authored at least 40 papers between 1992 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Designing multi-period supply contracts in a two-echelon supply chain with asymmetric information.
Eur. J. Oper. Res., 2019

Robust pooling for contracting models with asymmetric information.
Eur. J. Oper. Res., 2019

2017
A note on "A multi-period profit maximizing model for retail supply chain management".
Eur. J. Oper. Res., 2017

2016
A Quasi-Robust Optimization Approach for Crew Rescheduling.
Transp. Sci., 2016

Forecasting Human African Trypanosomiasis Prevalences from Population Screening Data Using Continuous Time Models.
PLoS Comput. Biol., 2016

Designing Sustainable Last-Mile Delivery Services in Online Retailing.
ERCIM News, 2016

2015
The economic lot-sizing problem with an emission capacity constraint.
Eur. J. Oper. Res., 2015

2014
Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price.
Manuf. Serv. Oper. Manag., 2014

Online stochastic UAV mission planning with time windows and time-sensitive targets.
Eur. J. Oper. Res., 2014

2012
Integrated market selection and production planning: complexity and solution approaches.
Math. Program., 2012

2011
A Method for Clustering Surgical Cases to Allow Master Surgical Scheduling.
INFOR Inf. Syst. Oper. Res., 2011

A robust approach to the missile defence location problem.
Int. J. Intell. Def. Support Syst., 2011

2010
Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics.
Oper. Res., 2010

2009
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters.
Oper. Res. Lett., 2009

2008
Four equivalent lot-sizing models.
Oper. Res. Lett., 2008

2006
A solution approach for dynamic vehicle and crew scheduling.
Eur. J. Oper. Res., 2006

A polynomial time algorithm for a deterministic joint pricing and inventory model.
Eur. J. Oper. Res., 2006

An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem.
Comput. Oper. Res., 2006

2005
Multiple-Depot Integrated Vehicle and Crew Scheduling.
Transp. Sci., 2005

A comparison of methods for lot-sizing in a rolling horizon environment.
Oper. Res. Lett., 2005

Integrated Lot Sizing in Serial Supply Chains with Production Capacities.
Manag. Sci., 2005

2004
A Robust Solution Approach to the Dynamic Vehicle Scheduling Problem.
Transp. Sci., 2004

A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm.
Ann. Oper. Res., 2004

2003
Models and Algorithms for Integration of Vehicle and Crew Scheduling.
J. Sched., 2003

A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem.
Oper. Res., 2003

Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents.
Constraints An Int. J., 2003

2002
Logistic Systems Analysis: Third Revised and Enlarged Edition.
J. Oper. Res. Soc., 2002

A savings based method for real-life vehicle routing problems.
J. Oper. Res. Soc., 2002

2001
Models and Algorithms for Single-Depot Vehicle Scheduling.
Transp. Sci., 2001

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems.
Math. Oper. Res., 2001

A Dynamic Lot-Sizing Model with Demand Time Windows.
Manag. Sci., 2001

2000
Improved dynamic programs for some batching problems involving the maximum lateness criterion.
Oper. Res. Lett., 2000

1999
On the Complexity of Postoptimality Analysis of 0/1 Programs.
Discret. Appl. Math., 1999

1998
Calculation of stability radii for combinatorial optimization problems.
Oper. Res. Lett., 1998

On the calculation of the stability radiusof an optimal or an approximate schedule.
Ann. Oper. Res., 1998

1996
An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds.
INFORMS J. Comput., 1996

1994
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs.
SIAM J. Discret. Math., 1994

Sensitivity Analysis of List Scheduling Heuristics.
Discret. Appl. Math., 1994

1993
Sensitivity Analysis of the Economic Lot-Sizing Problem.
Discret. Appl. Math., 1993

1992
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case.
Oper. Res., 1992


  Loading...