Albert P. M. Wagelmans
Orcid: 0000-0003-4803-8262Affiliations:
- Erasmus University Rotterdam, Econometric Institute, Netherlands
According to our database1,
Albert P. M. Wagelmans
authored at least 41 papers
between 1992 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2023
2019
Designing multi-period supply contracts in a two-echelon supply chain with asymmetric information.
Eur. J. Oper. Res., 2019
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
Forecasting Human African Trypanosomiasis Prevalences from Population Screening Data Using Continuous Time Models.
PLoS Comput. Biol., 2016
ERCIM News, 2016
2015
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
Eur. J. Oper. Res., 2014
2012
Integrated market selection and production planning: complexity and solution approaches.
Math. Program., 2012
2011
INFOR Inf. Syst. Oper. Res., 2011
Int. J. Intell. Def. Support Syst., 2011
2010
Oper. Res., 2010
2009
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters.
Oper. Res. Lett., 2009
2008
2006
Eur. J. Oper. Res., 2006
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
Oper. Res. Lett., 2005
Manag. Sci., 2005
2004
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
J. Sched., 2003
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
J. Oper. Res. Soc., 2002
J. Oper. Res. Soc., 2002
2001
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems.
Math. Oper. Res., 2001
2000
Improved dynamic programs for some batching problems involving the maximum lateness criterion.
Oper. Res. Lett., 2000
1999
Discret. Appl. Math., 1999
1998
Oper. Res. Lett., 1998
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
SIAM J. Discret. Math., 1994
1993
1992
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case.
Oper. Res., 1992