Thomas W. M. Vossen

According to our database1, Thomas W. M. Vossen authored at least 12 papers between 1999 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching.
INFORMS J. Comput., 2024

2021
A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Scheduling with Autonomous Learning Effects.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2016
Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing.
Oper. Res., 2016

2015
Reductions of Approximate Linear Programs for Network Revenue Management.
Oper. Res., 2015

2010
The one-dimensional cutting stock problem with due dates.
Eur. J. Oper. Res., 2010

2009
Matchings in connection with ground delay program planning.
Networks, 2009

2008
Research Note - Vertical Information Sharing in a Volatile Market.
Mark. Sci., 2008

Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective.
J. Artif. Intell. Res., 2008

2007
An LP-Based Heuristic for Optimal Planning.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2006
Slot Trading Opportunities in Collaborative Ground Delay Programs.
Transp. Sci., 2006

2005
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

1999
On the Use of Integer Programming Models in AI Planning.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999


  Loading...