IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v228y2013i1p83-92.html
   My bibliography  Save this item

Compact formulations of the Steiner Traveling Salesman Problem and related problems

Citations

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


Cited by:

  1. Scholz, André & Schubert, Daniel & Wäscher, Gerhard, 2017. "Order picking with multiple pickers and due dates – Simultaneous solution of Order Batching, Batch Assignment and Sequencing, and Picker Routing Problems," European Journal of Operational Research, Elsevier, vol. 263(2), pages 461-478.
  2. Su, Yixuan & Zhu, Xi & Yuan, Jinlong & Teo, Kok Lay & Li, Meixia & Li, Chunfa, 2023. "An extensible multi-block layout warehouse routing optimization model," European Journal of Operational Research, Elsevier, vol. 305(1), pages 222-239.
  3. HILL, Alessandro & VOß, Stefan, 2014. "Optimal capacitated ring trees," Working Papers 2014012, University of Antwerp, Faculty of Business and Economics.
  4. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
  5. Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
  6. Yann Ruberg & André Scholz, 2016. "A Mathematical Programming Formulation for the Single-Picker Routing Problem in a Multi-Block Layout," FEMM Working Papers 160002, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  7. Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.
  8. Saylam, Serhat & Çelik, Melih & Süral, Haldun, 2024. "Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses," European Journal of Operational Research, Elsevier, vol. 313(1), pages 225-240.
  9. Scholz, André & Henn, Sebastian & Stuhlmann, Meike & Wäscher, Gerhard, 2016. "A new mathematical programming formulation for the Single-Picker Routing Problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 68-84.
  10. Jiang, Jie & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services," European Journal of Operational Research, Elsevier, vol. 312(1), pages 125-137.
  11. Neves-Moreira, Fábio & Amorim, Pedro, 2024. "Learning efficient in-store picking strategies to reduce customer encounters in omnichannel retail," International Journal of Production Economics, Elsevier, vol. 267(C).
  12. Castro de Andrade, Rafael, 2016. "New formulations for the elementary shortest-path problem visiting a given set of nodes," European Journal of Operational Research, Elsevier, vol. 254(3), pages 755-768.
  13. André Scholz & Daniel Schubert & Gerhard Wäscher, 2016. "Order picking with multiple pickers and due dates – Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems," FEMM Working Papers 160005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  14. Briant, Olivier & Cambazard, Hadrien & Cattaruzza, Diego & Catusse, Nicolas & Ladier, Anne-Laure & Ogier, Maxime, 2020. "An efficient and general approach for the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 285(2), pages 497-512.
  15. Lu, Wenrong & McFarlane, Duncan & Giannikas, Vaggelis & Zhang, Quan, 2016. "An algorithm for dynamic order-picking in warehouse operations," European Journal of Operational Research, Elsevier, vol. 248(1), pages 107-122.
  16. Yang, Fei & Dai, Ying & Ma, Zu-Jun, 2020. "A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
  17. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
  18. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
  19. André Scholz, 2016. "An Exact Solution Approach to the Single-Picker Routing Problem in Warehouses with an Arbitrary Block Layout," FEMM Working Papers 160006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  20. Raeesi, Ramin & Zografos, Konstantinos G., 2019. "The multi-objective Steiner pollution-routing problem on congested urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 457-485.
  21. Rodríguez-Pereira, Jessica & Fernández, Elena & Laporte, Gilbert & Benavent, Enrique & Martínez-Sykora, Antonio, 2019. "The Steiner Traveling Salesman Problem and its extensions," European Journal of Operational Research, Elsevier, vol. 278(2), pages 615-628.
  22. Alessandro Hill & Stefan Voß, 2016. "Optimal capacitated ring trees," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 137-166, May.
  23. Letchford, Adam N. & Nasiri, Saeideh D., 2015. "The Steiner travelling salesman problem with correlated costs," European Journal of Operational Research, Elsevier, vol. 245(1), pages 62-69.
  24. Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
  25. John S. F. Lyons & Peter C. Bell & Mehmet A. Begen, 2018. "Solving the Whistler-Blackcomb Mega Day Challenge," Interfaces, INFORMS, vol. 48(4), pages 323-339, August.
  26. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
  27. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.