On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.86-92, 2000. ,
DOI : 10.1109/SFCS.2000.892068
Minimal spanning tree subject to a side constraint, Computers & Operations Research, vol.9, issue.4, pp.287-296, 1982. ,
DOI : 10.1016/0305-0548(82)90026-0
Some considerations about computational complexity for multi objective combinatorial problems Recent Advances and Historical Development of Vector Optimization, of Lecture Notes in Economics and Mathematical Systems, pp.222-232, 1987. ,
On the existence of schedules that are near-optimal for both makespan and total weighted completion time, Operations Research Letters, vol.21, issue.3, pp.115-122, 1997. ,
DOI : 10.1016/S0167-6377(97)00025-4
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.723-731, 2002. ,
A note on scheduling to meet two min-sum objectives, Operations Research Letters, vol.35, issue.1, pp.35-69, 2007. ,
DOI : 10.1016/j.orl.2006.01.004
URL : https://hal.archives-ouvertes.fr/hal-00341342
Fair solutions for some multiagent optimization problems, Autonomous Agents and Multi-Agent Systems, vol.7, issue.1, pp.184-201, 2013. ,
DOI : 10.1007/s10458-011-9188-z
Approximate tradeoffs on weighted labeled matroids, Discrete Applied Mathematics, vol.184, 2014. ,
DOI : 10.1016/j.dam.2014.11.005
Approximation algorithms for the bi-criteria weighted MAX-CUT problem, Discrete Applied Mathematics, vol.154, issue.12, pp.1685-1692, 2006. ,
DOI : 10.1016/j.dam.2006.02.008
URL : https://hal.archives-ouvertes.fr/hal-00341348
Approximation with a fixed number of solutions of some multiobjective maximization problems, Journal of Discrete Algorithms, vol.22, pp.19-29, 2013. ,
DOI : 10.1016/j.jda.2013.06.006
Deterministic algorithms for multi-criteria Max-TSP, Discrete Applied Mathematics, vol.160, issue.15, pp.2277-2285, 2012. ,
DOI : 10.1016/j.dam.2012.05.007
URL : http://eprints.eemcs.utwente.nl/secure2/00020152/01/TAMC2011_Manthey_MultiCritTSP.pdf
On approximating multicriteria TSP, ACM Transactions on Algorithms, vol.8, issue.2, p.17, 2012. ,
DOI : 10.1145/2151171.2151180
URL : https://hal.archives-ouvertes.fr/inria-00360080
Single approximation for the biobjective max tsp, Theor. Comput. Sci, pp.478-519, 2013. ,
The two-phases method: An efficient procedure to solve bi-objective combinatorial optimization problems, Foundations of Computing and Decision Sciences, vol.20, pp.149-165, 1994. ,
Two phase algorithms for the bi-objective assignment problem, European Journal of Operational Research, vol.185, issue.2, pp.509-533, 2008. ,
DOI : 10.1016/j.ejor.2006.12.054
URL : https://hal.archives-ouvertes.fr/hal-00461989
Many birds with one stone, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.438-447, 1993. ,
DOI : 10.1145/167088.167209
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
Budgeted matching and budgeted matroid intersection via the gasoline puzzle, Math. Program, pp.128-355, 2011. ,
DOI : 10.1007/s10107-009-0307-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.8773
New approaches to multi-objective optimization, Mathematical Programming, vol.9, issue.1, pp.525-554, 2014. ,
DOI : 10.1007/s10107-013-0703-7