Jacques Desrosiers
Orcid: 0000-0003-0719-1500
According to our database1,
Jacques Desrosiers
authored at least 56 papers
between 1984 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
Eur. J. Oper. Res., 2022
2019
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem.
J. Sched., 2019
2018
2017
Oper. Res. Lett., 2017
Comput. Oper. Res., 2017
2016
EURO J. Transp. Logist., 2016
2015
2014
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.
J. Heuristics, 2014
Eur. J. Oper. Res., 2014
2013
Comput. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
Comput. Oper. Res., 2012
2011
A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition.
Int. J. Math. Oper. Res., 2011
2010
Transp. Sci., 2010
INFORMS J. Comput., 2010
Solving multi-stage stochastic in-house production and outsourcing planning by two-level decomposition.
Int. J. Math. Oper. Res., 2010
Comput. Oper. Res., 2010
2009
Discret. Appl. Math., 2009
2007
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
Eur. J. Oper. Res., 2007
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems.
Comput. Oper. Res., 2007
2006
Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues.
Eur. J. Oper. Res., 2006
Comput. Oper. Res., 2006
2005
Bombardier Flexjet Significantly Improves Its Fractional Aircraft Ownership Operations.
Interfaces, 2005
Ann. Oper. Res., 2005
2002
2001
Transp. Sci., 2001
Transp. Sci., 2001
Oper. Res., 2001
2000
Transp. Sci., 2000
Air Transat Uses ALTITUDE to Manage Its Aircraft Routing, Crew Pairing, and Work Assignment.
Interfaces, 2000
1999
Oper. Res., 1999
Eur. J. Oper. Res., 1999
1998
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs.
Networks, 1998
1995
Transp. Sci., 1995
Oper. Res., 1995
A new branching strategy for time constrained routing problems with application to backhauling.
Ann. Oper. Res., 1995
1993
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows.
Networks, 1993
Proceedings of the Cliques, 1993
1992
Oper. Res., 1992
1990
Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs.
Transp. Sci., 1990
1988
Transp. Sci., 1988
1984