Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th. Exponential approximation schemata for some network design problems. (English) Zbl 1334.68300 J. Discrete Algorithms 22, 43-52 (2013). MSC: 68W25 68Q25 90B10 90C27 90C35 PDFBibTeX XMLCite \textit{N. Boria} et al., J. Discrete Algorithms 22, 43--52 (2013; Zbl 1334.68300) Full Text: DOI
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Reoptimization of minimum and maximum traveling salesman’s tours. (English) Zbl 1180.90259 J. Discrete Algorithms 7, No. 4, 453-463 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{G. Ausiello} et al., J. Discrete Algorithms 7, No. 4, 453--463 (2009; Zbl 1180.90259) Full Text: DOI
Demange, Marc; Paschos, Vangelis Th. Polynomial approximation algorithms with performance guarantees: an introduction-by-example. (English) Zbl 1062.90053 Eur. J. Oper. Res. 165, No. 3, 555-568 (2005). MSC: 90C27 65Y20 PDFBibTeX XMLCite \textit{M. Demange} and \textit{V. Th. Paschos}, Eur. J. Oper. Res. 165, No. 3, 555--568 (2005; Zbl 1062.90053) Full Text: DOI
Ausiello, G.; Demange, M.; Laura, L.; Paschos, V. Algorithms for the on-line quota traveling salesman problem. (English) Zbl 1178.90282 Inf. Process. Lett. 92, No. 2, 89-94 (2004). MSC: 90C27 PDFBibTeX XMLCite \textit{G. Ausiello} et al., Inf. Process. Lett. 92, No. 2, 89--94 (2004; Zbl 1178.90282) Full Text: DOI Link
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie Differential approximation results for the traveling salesman problem with distances 1 and 2. (English) Zbl 1012.90044 Eur. J. Oper. Res. 145, No. 3, 557-568 (2003). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Monnot} et al., Eur. J. Oper. Res. 145, No. 3, 557--568 (2003; Zbl 1012.90044) Full Text: DOI
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie Approximation algorithms for the traveling salesman problem. (English) Zbl 1064.90572 Math. Methods Oper. Res. 56, No. 3, 387-405 (2002). MSC: 90C35 68W25 90C27 90C60 90C59 PDFBibTeX XMLCite \textit{J. Monnot} et al., Math. Methods Oper. Res. 56, No. 3, 387--405 (2002; Zbl 1064.90572) Full Text: DOI
Likas, Aristidis; Paschos, Vangelis Th. A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem. (English) Zbl 0978.90099 Chaos Solitons Fractals 13, No. 1, 71-78 (2002). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{A. Likas} and \textit{V. Th. Paschos}, Chaos Solitons Fractals 13, No. 1, 71--78 (2002; Zbl 0978.90099) Full Text: DOI
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie Differential approximation results for the traveling salesman problem with distances 1 and 2 (extended abstract). (English) Zbl 1003.90035 Freivalds, Rūsiņš (ed.), Fundamentals of computation theory. 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2138, 275-286 (2001). MSC: 90C27 90C60 68Q17 05C85 PDFBibTeX XMLCite \textit{J. Monnot} et al., Lect. Notes Comput. Sci. 2138, 275--286 (2001; Zbl 1003.90035) Full Text: Link
Bellalouna, Monia; Murat, Cécile; Paschos, Vangelis Th. Probabilistic combinatorial optimization problems on graphs: A new domain in operational research. (English) Zbl 0915.90213 Eur. J. Oper. Res. 87, No. 3, 693-706 (1995). MSC: 90C15 90C27 90C35 PDFBibTeX XMLCite \textit{M. Bellalouna} et al., Eur. J. Oper. Res. 87, No. 3, 693--706 (1995; Zbl 0915.90213) Full Text: DOI