A. Abboud and K. Lewi, Exact Weight Subgraphs and the k-Sum Conjecture, ICALP 2013, Part I, pp.1-12, 2013.
DOI : 10.1007/978-3-642-39206-1_1
URL : http://arxiv.org/pdf/1304.7558.pdf

Y. P. Aneja, V. Aggarwal, and K. P. Nair, Shortest chain subject to side constraints, Networks, vol.1, issue.2, pp.13-295, 1983.
DOI : 10.1007/978-3-642-80808-1

C. Archetti, M. G. Speranza, and D. Vigo, Vehicle routing problems with profits, Vehicle Routing. Problems, Methods, and Applications, Second Edition, MOS-SIAM Series on Optimization, pp.273-297, 2014.
DOI : 10.1137/1.9781611973594.ch10

F. Barahona and W. R. Pulleyblank, Exact arborescences, matchings and cycles, Discrete Applied Mathematics, vol.16, issue.2, pp.91-99, 1987.
DOI : 10.1016/0166-218X(87)90067-9
URL : https://doi.org/10.1016/0166-218x(87)90067-9

N. Boland, J. Dethridge, and I. Dumitrescu, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Operations Research Letters, vol.34, issue.1, pp.58-68, 2006.
DOI : 10.1016/j.orl.2004.11.011
URL : http://www.diku.dk/PATH05/EWCSPP_published.pdf

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-118, 2005.
DOI : 10.1287/trsc.1030.0056

P. Brucker, M. Y. Kovalyov, Y. M. Shafransky, and F. Werner, Batch scheduling with deadlines on parallel machines, Annals of Operations Research, vol.83, pp.23-40, 1998.
DOI : 10.1023/A:1018912114491

T. Breugem, T. Dollevoet, and W. Van, Analysis of FPTASes for the multi-objective shortest path problem, Computers & Operations Research, vol.78, pp.44-58, 2017.
DOI : 10.1016/j.cor.2016.06.022

T. C. Cheng, A. Janiak, and M. Y. Kovalyov, Bicriterion Single Machine Scheduling with Resource Dependent Processing Times, SIAM Journal on Optimization, vol.8, issue.2, pp.617-630, 1998.
DOI : 10.1137/S1052623495288192
URL : http://ira.lib.polyu.edu.hk/bitstream/10397/6037/1/Cheng_Bicriterion_Single_Machine.pdf

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2009.

M. Desrochers, La fabrication d'horaires de travail pour les conducteurs d'autobus par une methode de generation de colonnes, Publication Canada, vol.470, 1986.

R. B. Dial, A model and algorithm for multicriteria route-mode choice, Transportation Research Part B: Methodological, vol.13, issue.4, pp.311-316, 1979.
DOI : 10.1016/0191-2615(79)90024-9

A. Dolgui, M. Y. Kovalyov, and A. Quilliot, Knapsack problem with objective value gaps, Optimization Letters, pp.31-39, 2017.
DOI : 10.1007/s11590-016-1043-3

F. Ergun, R. Sinha, and L. Zhang, An improved FPTAS for Restricted Shortest Path, Information Processing Letters, vol.83, issue.5, pp.287-291, 2002.
DOI : 10.1016/S0020-0190(02)00205-3

S. Fortune, J. E. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2
URL : https://doi.org/10.1016/0304-3975(80)90009-2

R. Garcia, Resource constrained shortest paths and extensions, 2009.

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NPcompleteness, 1979.

P. Hansen, Bicriterion Path Problems, Theory and applications. Proc. 3rd Conf. Multiple Criteria Decision Making, pp.109-127, 1979.
DOI : 10.1007/978-3-642-48782-8_9

R. Hassin, Approximation Schemes for the Restricted Shortest Path Problem, Mathematics of Operations Research, vol.17, issue.1, pp.36-42, 1992.
DOI : 10.1287/moor.17.1.36

H. C. Joksch, The shortest route problem with constraints, Journal of Mathematical Analysis and Applications, vol.14, issue.2, pp.191-197, 1966.
DOI : 10.1016/0022-247X(66)90020-5
URL : https://doi.org/10.1016/0022-247x(66)90020-5

K. Kao, J. Chang, Y. Wang, and J. S. Juan, A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs, Algorithmica, vol.3, issue.2, pp.61-402, 2011.
DOI : 10.1137/0203006

A. V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Cybernetics, vol.23, issue.1, pp.8-13, 1987.
DOI : 10.1007/BF01068796

I. Krasikov and S. D. Noble, Finding next-to-shortest paths in a graph, Information Processing Letters, vol.92, issue.3, pp.117-119, 2004.
DOI : 10.1016/j.ipl.2004.06.020

K. N. Lalgudi and M. C. Papaefthymiou, Computing strictly-second shortest paths, Information Processing Letters, vol.63, issue.4, pp.177-181, 1997.
DOI : 10.1016/S0020-0190(97)00122-1

M. Leclerc, Polynomial time algorithms for exact matching problems, 1986.

S. Li, G. Sun, and G. Chen, Improved algorithm for finding next-to-shortest paths, Information Processing Letters, vol.99, issue.5, pp.192-194, 2006.
DOI : 10.1016/j.ipl.2006.04.013

C. Lopéz, R. Stern, and A. Felner, Solving the target-value search problem, Proceedings of the Seventh Annual Symposium on Combinatorial Search, pp.2014-202, 2014.

D. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem, Operations Research Letters, vol.28, issue.5, pp.213-219, 2001.
DOI : 10.1016/S0167-6377(01)00069-4

G. Lucarelli, N. K. Thang, A. Srivastav, and D. Trystram, Online nonpreemptive scheduling in a resource augmentation model based on duality, Proc. 24th European Symposium on Algorithms, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334219

M. Milanic and J. Monnot, The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes, Electronic Notes in Discrete Mathematics, vol.35, pp.317-322, 2009.
DOI : 10.1016/j.endm.2009.11.052

C. H. Papadimitriou and M. Yannakakis, The complexity of restricted spanning tree problems, Journal of the ACM, vol.29, issue.2, pp.285-309, 1982.
DOI : 10.1145/322307.322309

G. Righini and M. Salani, 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, 2006.
DOI : 10.1016/j.disopt.2006.05.007

T. Tholey, Solving the 2-Disjoint Paths Problem in Nearly Linear Time, Lecture Notes in Computer Science, vol.2996, pp.350-361, 2004.
DOI : 10.1007/978-3-540-24749-4_31

G. Tsaggouris and C. Zaroliagis, Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications, Theory of, Computing Systems, vol.45, issue.1, pp.162-186, 2009.

V. Vassilevska and R. Williams, Finding, minimizing, and counting weighted subgraphs, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.455-464, 2009.
DOI : 10.1145/1536414.1536477

A. Warburton, Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems, Operations Research, vol.35, issue.1, pp.70-79, 1987.
DOI : 10.1287/opre.35.1.70

B. Y. Wu and H. Wang, The next-to-shortest path problem on directed graphs with positive edge weights, Networks, vol.17, issue.3, pp.205-211, 2015.
DOI : 10.1287/mnsc.17.11.712

C. Zhang and H. Nagamochi, The next-to-shortest path in undirected graphs with nonnegative weights, Proceedings of 18th Computing: The Australasian Theory Symposium (CATS), pp.2012-2025