Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits

Computers and Operations Research

Volumn 40, Issue 10, 2013, Pages 2418-2428

  Filippi, Carlo ^a   Stevanato, Elisa ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Approximation; Complexity; Multi objective combinatorial optimization; TSP with profits

Indexed keywords

APPROXIMATION; APPROXIMATION SCHEME; BI-OBJECTIVE COMBINATORIAL OPTIMIZATION; COMPLEXITY; CONFLICTING OBJECTIVES; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; SIMPLE MODIFICATIONS; TRAVELING SALESMAN PROBLEM WITH PROFITS;

COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; PROFITABILITY; TRAVELING SALESMAN PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 84879039654     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.02.011     Document Type: Article

References (32)

1. E. Angel, E. Bampis, and L. Gourvès Approximating the pareto curve with local search for the bicriteria TSP(1,2) problem Theoretical Computer Science 310 2004 135 146
2. E. Angel, E. Bampis, and L. Gourvès Approximation results for a bicriteria job scheduling problem on a single machine without preemption Information Processing Letters 94 2005 19 27 (Pubitemid 40259609)
3. E. Angel, E. Bampis, and L. Gourvès Approximation algorithms for the bi-criteria weighted max-cut problem Discrete Applied Mathematics 154 2006 1685 1692 (Pubitemid 43795358)
4. E. Angel, E. Bampis, and A. Kononov On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems Theoretical Computer Science 306 2003 319 338
5. J.F. Bérubé, M. Gendreau, and J.Y. Potvin An exact ε-constraint method for bi-objective combinatorial optimization problems application to the traveling salesman problem with profits European Journal of Operational Research 194 2009 39 50
6. C.C. Chern, and J.S. Hsieh A heuristic algorithm for master planning that satisfies multiple objectives Computers and Operations Research 34 2007 3491 3513
7. Coene S, Spieksma FRC, Filippi C, Stevanato E. The traveling salesman problem on trees: balancing profits and costs. Networks, 2013;61:200-11.
8. I. Diakonikolas, and M. Yannakakis Small approximate Pareto sets for bi-objective shortest path and other problems SIAM Journal on Computing 39 2009 1340 1371
9. M. Ehrgott Approximation algorithms for combinatorial multicriteria optimization problems International Transactions in Operational Research 7 2000 5 31
10. A. Engau, and M.M. Wiecek Generating epsilon-efficient solutions in multi-objective programming European Journal of Operational Research 177 2007 1566 1579 (Pubitemid 44709446)
11. T. Erlebach, H. Kellerer, and U. Pferschy Approximating multiobjective knapsack problems Management Science 48 2002 1603 1612
12. D. Feillet, P. Dejax, and M. Gendreau Traveling salesman problems with profits Transportation Science 39 2005 188 205 (Pubitemid 40748589)
13. Filippi C, Stevanato E. An exact approach to bi-objective combinatorial optimization and its application to the TSP with profits. Technical Report 359, DMQ - University of Brescia; April 2011. 〈 http://chiara.eco.unibs.it/ ∼filippi/FilSte11-DMQ.pdf 〉.
14. A. Goldberg, and R. Tarjan A new approach to the maximum flow problem Journal of the Association for Computing Machinery 35 4 1988 921 940
15. H.W. Hamacher, C.R. Pedersen, and S. Ruzika Finding representative systems for discrete bicriterion optimization problems Operations Research Letters 35 2007 336 344 (Pubitemid 46589655)
16. P. Hansen Bicriterion path problems T. Gal, G. Fandel, Multiple criteria decision making theory and application. Lecture notes in economics and mathematical systems vol. 177 1979 Springer Berlin 109 127
17. J. Jahn Vector optimization 2nd ed. 2011 Springer Berlin
18. N. Jozefowiez, F. Glover, and M. Laguna Multi-objective meta-heuristics for the traveling salesman problem with profits Journal of Mathematical Modelling and Algorithms 7 2008 177 195
19. P. Lacomme, C. Prins, and M. Sevaux A genetic algorithm for a bi-objective capacitated arc routing problem Computers and Operations Research 33 2006 3473 3493
20. J.R. Ledesma, and J.J. Salazar The bi-objective travelling purchaser problem European Journal of Operational Research 160 2005 599 613
21. P. Loridan Necessary conditions for ε-optimality Mathematical Programming Studies 19 1982 140 152
22. P. Loridan ε-solutions in vector minimization problems Journal of Optimization Theory and Applications 43 1984 265 276
23. C. Low, Y. Yip, and T.H. Wu Modelling and heuristics of FMS scheduling with multiple objectives Computers and Operations Research 33 2006 674 694 (Pubitemid 41101119)
24. I. Osman, and G. Laporte Metaheuristics a bibliography Annals of Operations Research 63 1996 513 623
25. A. Przybylski, X. Gandibleux, and M. Ehrgott Two phase algorithms for the bi-objective assignment problem European Journal of Operational Research 185 2008 509 533 (Pubitemid 47454672)
26. G. Reinelt A traveling salesman problem library ORSA Journal on Computing 3 1991 376 384
27. A. Schrijver Theory of linear and integer programming (Wiley-Interscience series in discrete mathematics and optimization) 2nd ed. 1998 Wiley
28. A. Sergienko, and V.A. Perepelitsa Finding the set of alternatives in discrete multicriterion problems Cybernetics 27 1991 673 683
29. S. Vassilvitskii, and M. Yannakakis Efficiently computing succint trade-off curves Theoretical Computer Science 348 2005 334 356
30. A. Warburton Approximation of pareto optima in multiple-objective shortest path problem Operations Research 35 1987 70 79 (Pubitemid 17620345)
31. D.J. White Epsilon efficiency Journal of Optimization Theory and Applications 49 1986 319 337
32. K. Yokoyama Epsilon approximate solutions for multiobjective programming problems Journal of Mathematical Analysis and Applications 203 1996 142 149 (Pubitemid 126170742)