IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v48y2010i4p569-582.html
   My bibliography  Save this article

Pyramidal tours and multiple objectives

Author

Listed:
  • Özgür Özpeynirci
  • Murat Köksalan

Abstract

No abstract is available for this item.

Suggested Citation

  • Özgür Özpeynirci & Murat Köksalan, 2010. "Pyramidal tours and multiple objectives," Journal of Global Optimization, Springer, vol. 48(4), pages 569-582, December.
    • Handle: RePEc:spr:jglopt:v:48:y:2010:i:4:p:569-582
    DOI: 10.1007/s10898-009-9505-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9505-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9505-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. van Dal, Rene & van der Veen, Jack A. A. & Sierksma, Gerard, 1993. "Small and large TSP: Two polynomially solvable cases of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 69(1), pages 107-120, August.
    2. van der Veen, Jack A. A. & Sierksma, Gerard & van Dal, Rene, 1991. "Pyramidal tours and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 52(1), pages 90-102, May.
    3. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    4. Oda, Yoshiaki, 2002. "An asymmetric analog of van der Veen conditions and the traveling salesman problem (II)," European Journal of Operational Research, Elsevier, vol. 138(1), pages 43-62, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2012. "The x-and-y-axes travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 333-345.
    2. S. Dutta & S. Acharya & Rajashree Mishra, 2016. "Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 835-872, December.
    3. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    4. Yang, X. Q. & Goh, C. J., 1997. "A method for convex curve approximation," European Journal of Operational Research, Elsevier, vol. 97(1), pages 205-212, February.
    5. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
    6. KIKOMBA KAHUNGU, Michaël & MABELA MAKENGO MATENDO, Rostin & M. NGOIE, Ruffin-Benoît & MAKENGO MBAMBALU, Fréderic & OKITONYUMBE Y.F, Joseph, 2013. "Les fondements mathématiques pour une aide à la décision du réseau de transport aérien : cas de la République Démocratique du Congo [Mathematical Foundation for Air Traffic Network Decision Aid : C," MPRA Paper 68533, University Library of Munich, Germany, revised Mar 2013.
    7. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    8. Singh, Preetvanti & Saxena, P. K., 2003. "The multiple objective time transportation problem with additional restrictions," European Journal of Operational Research, Elsevier, vol. 146(3), pages 460-476, May.
    9. Pankaj Gupta & Mukesh Mehlawat, 2007. "An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 114-137, July.
    10. Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
    11. Diclehan Tezcaner & Murat Köksalan, 2011. "An Interactive Algorithm for Multi-objective Route Planning," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 379-394, August.
    12. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
    13. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 597-618, November.
    14. Julius Bauß & Michael Stiglmayr, 2024. "Augmenting bi-objective branch and bound by scalarization-based information," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 85-121, August.
    15. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
    16. Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
    17. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    18. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    19. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    20. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:48:y:2010:i:4:p:569-582. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.