Optimal solutions for routing problems with profits, Discrete Applied Mathematics, vol.161, issue.4, pp.547-557, 2013. ,
The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, vol.60, issue.6, pp.831-842, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01299943
, , 2011.
, An exact algorithm for the pickup and delivery problem with time windows, Operations Research, vol.59, issue.2, pp.414-426
, , 2008.
, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, pp.351-385
, , 2011.
, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283
, , 2006.
, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, European Journal of Operational Research, vol.171, issue.1, pp.85-106
, , 2018.
, A branch-and-cut algorithm for the team orienteering problem, International Transactions in Operational Research, vol.25, issue.2, pp.627-635
, J. a. P, 2016.
, Bin packing and related problems: General arc-flow formulation with graph compression
, Computers & Operations Research, vol.69, pp.56-67
The vehicle routing problem with service level constraints, European Journal of Operational Research, vol.265, issue.2, pp.544-558, 2018. ,
, , 2018.
, A branch-and-price algorithm for the minimum latency problem, Computers & Operations Research, vol.93, pp.66-78
, , 2001.
, Lower bounds and algorithms for the 2-dimensional vector packing problem, Discrete Applied Mathematics, vol.111, issue.3, pp.231-262
The team orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.464-474, 1996. ,
, References IV
, , 2017.
, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, European Journal of Operational Research, vol.258, issue.2, pp.467-477
, , 2016.
, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, vol.255, issue.1, pp.1-20
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, 2018. ,
, European Journal of Operational Research, vol.266, issue.2, pp.521-530
, , 2017.
, Stabilized branch-and-price algorithms for vector packing problems
, , 2017.
, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, European Journal of Operational Research, vol.260, issue.1, pp.70-80
, , 1994.
, A dynamic programming method for single machine scheduling, European Journal of Operational Research, vol.76, issue.1, pp.72-82
, , 2010.
, Path-reduced costs for eliminating arcs in routing and scheduling, INFORMS Journal on Computing, vol.22, issue.2, pp.297-313
Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511, 2008. ,
, , 1983.
, A branch and bound algorithm for the capacitated vehicle routing problem, Operations-Research-Spektrum, vol.5, issue.2, pp.77-85
, , 2003.
, A metaheuristic for the pickup and delivery problem with time windows, International Journal on Artificial Intelligence Tools, vol.12, issue.02, pp.173-186
, , 2004.
, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Mathematical Programming, vol.100, issue.2, pp.423-445
, , 2003.
, Solving the generalized assignment problem: An optimizing and heuristic approach, INFORMS Journal on Computing, vol.15, issue.3, pp.249-266
New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017. ,
Improved branch-cut-and-price for capacitated vehicle routing, Mathematical Programming Computation, vol.9, issue.1, pp.61-100, 2017. ,
Limited memory rank-1 cuts for vehicle routing problems, Operations Research Letters, vol.45, issue.3, pp.206-209, 2017. ,
, , 2017.
, Automation and combination of linear-programming based stabilization techniques in column generation
, , 2012.
, An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.52, pp.629-644
, , 2006.
, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273
, , 2014.
, Dynamic ng-path relaxation for the delivery man problem, Transportation Science, vol.48, issue.3, pp.413-424
, , 2009.
, Branch and cut and price for the pickup and delivery problem with time windows, Transportation Science, vol.43, issue.3, pp.267-286
, , 2017.
, A bucket graph based labeling algorithm with application to vehicle routing. Cadernos do LOGIS 7
, , 2018.
, Primal heuristics for branch-and-price: the assets of diving methods, INFORMS Journal on Computing
, , 1997.
, Weighted dantzig-wolfe decomposition for linear mixed-integer programming, International Transactions in Operational Research, vol.4, issue.2, pp.151-162