IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v35y1987i1p70-79.html
   My bibliography  Save this item

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
  2. Trzaskalik, Tadeusz & Sitarz, Sebastian, 2007. "Discrete dynamic programming with outcomes in random variable structures," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1535-1548, March.
  3. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
  4. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
  5. Arne Herzel & Stefan Ruzika & Clemens Thielen, 2021. "Approximation Methods for Multiobjective Optimization Problems: A Survey," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1284-1299, October.
  6. Jianping Li & Weidong Li & Junran Lichen, 2014. "The subdivision-constrained routing requests problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 152-163, January.
  7. Shashi Mittal & Andreas S. Schulz, 2013. "A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One," Operations Research, INFORMS, vol. 61(2), pages 386-397, April.
  8. Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
  9. Büsing, Christina & Goetzmann, Kai-Simon & Matuschke, Jannik & Stiller, Sebastian, 2017. "Reference points and approximation algorithms in multicriteria discrete optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 829-840.
  10. Strehler, Martin & Merting, Sören & Schwan, Christian, 2017. "Energy-efficient shortest routes for electric and hybrid vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 111-135.
  11. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
  12. Matthias Müller-Hannemann & Karsten Weihe, 2006. "On the cardinality of the Pareto set in bicriteria shortest path problems," Annals of Operations Research, Springer, vol. 147(1), pages 269-286, October.
  13. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
  14. Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
  15. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
  16. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
  17. Nagih, Anass & Soumis, Francois, 2006. "Nodal aggregation of resource constraints in a shortest path problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 500-514, July.
  18. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
  19. Rethmann, J. & Wanke, E., 2001. "Stack-up algorithms for palletizing at delivery industry," European Journal of Operational Research, Elsevier, vol. 128(1), pages 74-97, January.
  20. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
  21. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
  22. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
  23. Goldberg, Noam & Poss, Michael, 2020. "Maximum probabilistic all-or-nothing paths," European Journal of Operational Research, Elsevier, vol. 283(1), pages 279-289.
  24. Cataldo, Alejandro & Ferrer, Juan–Carlos, 2017. "Optimal pricing and composition of multiple bundles: A two-step approach," European Journal of Operational Research, Elsevier, vol. 259(2), pages 766-777.
  25. Jamain, Florian, 2014. "Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14002 edited by Bazgan, Cristina.
  26. Bazgan, Cristina & Hugot, Hadrien & Vanderpooten, Daniel, 2009. "Implementing an efficient fptas for the 0-1 multi-objective knapsack problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 47-56, October.
  27. Ishwar Murthy & Shenq‐Shyong Her, 1992. "Solving min‐max shortest‐path problems on a network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 669-683, August.
  28. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria combinatorial optimization," Working papers 3756-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
  29. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
  30. Mark M. Nejad & Lena Mashayekhy & Daniel Grosu & Ratna Babu Chinnam, 2017. "Optimal Routing for Plug-In Hybrid Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1304-1325, November.
  31. Christian Roed Pedersen & Lars Relund Nielsen & Kim Allan Andersen, 2008. "The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 400-411, August.
  32. Murthy, Ishwar & Sarkar, Sumit, 1997. "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, Elsevier, vol. 103(1), pages 209-229, November.
  33. Alexandre Dolgui & Mikhail Y. Kovalyov & Alain Quilliot, 2018. "Simple paths with exact and forbidden lengths," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 78-85, February.
  34. Nir Halman & Mikhail Y. Kovalyov & Alain Quilliot & Dvir Shabtay & Moshe Zofi, 2019. "Bi-criteria path problem with minimum length and maximum survival probability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 469-489, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.