Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 5180 results
Sort by: relevance publication year

Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers

JOURNAL ARTICLE published September 2020 in Networks

Research funded by DATAS for Cities (438-15-507) | Physical Internet Reisbeurzenprogramma (439-17-703)

Authors: Afonso Sampaio | Martin Savelsbergh | Lucas P. Veelenturf | Tom Van Woensel

https://doi.org/10.1002/net.21963 Actions

The pickup delivery location problem on networks

JOURNAL ARTICLE published December 1995 in Networks

Authors: Gur Mosheiov

https://doi.org/10.1002/net.3230260408 Actions

The multi‐commodity pickup‐and‐delivery traveling salesman problem

JOURNAL ARTICLE published January 2014 in Networks

Authors: Hipólito Hernández‐Pérez | Juan‐José Salazar‐González

https://doi.org/10.1002/net.21521 Actions

The traveling salesman problem with pickup, delivery, and ride-time constraints

JOURNAL ARTICLE published March 2016 in Networks

Authors: Enrico Bartolini | Lawrence Bodin | Aristide Mingozzi

https://doi.org/10.1002/net.21663 Actions

Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers

JOURNAL ARTICLE published April 2022 in Networks

Authors: Stefan Voigt | Heinrich Kuhn

https://doi.org/10.1002/net.22045 Actions

The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms

JOURNAL ARTICLE published December 2007 in Networks

Research funded by Ministerio de Educación y Ciencia (TIC2003-05982-C05-02,MTM2006-14961-C05-03)

Authors: Hipólito Hernández‐Pérez | Juan‐José Salazar‐González

https://doi.org/10.1002/net.20209 Actions

Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

JOURNAL ARTICLE published August 2012 in Networks

Authors: Jean‐François Côté | Michel Gendreau | Jean‐Yves Potvin

https://doi.org/10.1002/net.20448 Actions

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

JOURNAL ARTICLE published July 2005 in Networks

Authors: Patrizia Beraldi | Gianpaolo Ghiani | Gilbert Laporte | Roberto Musmanno

https://doi.org/10.1002/net.20063 Actions

The one‐commodity pickup and delivery travelling salesman problem on a path or a tree

JOURNAL ARTICLE published August 2006 in Networks

Authors: Fan Wang | Andrew Lim | Zhou Xu

https://doi.org/10.1002/net.20116 Actions

A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs

JOURNAL ARTICLE published October 2022 in Networks

Authors: Devaraj Radha Krishnan | Tieming Liu

https://doi.org/10.1002/net.22096 Actions

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

JOURNAL ARTICLE published January 2010 in Networks

Research funded by Canadian Natural Sciences and Engineering Research Council (227837-04,39682-05) | Spanish Ministerio de Educación (MTM2006-14961-C05-03)

Authors: Jean‐François Cordeau | Manuel Iori | Gilbert Laporte | Juan José Salazar González

https://doi.org/10.1002/net.20312 Actions

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

JOURNAL ARTICLE published December 2012 in Networks

Authors: Jean‐François Côté | Claudia Archetti | Maria Grazia Speranza | Michel Gendreau | Jean‐Yves Potvin

https://doi.org/10.1002/net.21459 Actions

Evolutionary Multiobjective Optimization for the Pickup and Delivery Problem with Time Windows and Demands

JOURNAL ARTICLE published February 2016 in Mobile Networks and Applications

Authors: Dũng H. Phan | Junichi Suzuki

https://doi.org/10.1007/s11036-016-0709-5 Actions

An exact algorithm for the service network design problem with hub capacity constraints

JOURNAL ARTICLE published December 2022 in Networks

Research funded by National Science Foundation of Sri Lanka (1662848)

Authors: Edward He | Natashia Boland | George Nemhauser | Martin Savelsbergh

https://doi.org/10.1002/net.22128 Actions

An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot

JOURNAL ARTICLE published September 2016 in Networks and Spatial Economics

Authors: Lanshan Han | Binh T. Luong | Satish Ukkusuri

https://doi.org/10.1007/s11067-015-9297-3 Actions

Evaluation of location area planning scenarios in future mobile telecommunication systems

JOURNAL ARTICLE published March 1995 in Wireless Networks

Authors: J. G. Markoulidakis | G. L. Lyberopoulos | D. F. Tsirkas | E. D. Sykas

https://doi.org/10.1007/bf01196255 Actions

Minimum bandwidth problem for embedding graphs in cycles

JOURNAL ARTICLE published May 1997 in Networks

Authors: Yixun Lin

https://doi.org/10.1002/(sici)1097-0037(199705)29:3<135::aid-net1>3.0.co;2-i Actions

Restricted delivery problems on a network

JOURNAL ARTICLE published July 1997 in Networks

Authors: Esther M. Arkin | Refael Hassin | Limor Klein

https://doi.org/10.1002/(sici)1097-0037(199707)29:4<205::aid-net3>3.0.co;2-j Actions

Restricted delivery problems on a network

JOURNAL ARTICLE published July 1997 in Networks

Authors: Esther M. Arkin | Refael Hassin | Limor Klein

https://doi.org/10.1002/(sici)1097-0037(199707)29:4<205::aid-net3>3.3.co;2-x Actions

Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

JOURNAL ARTICLE published July 2007 in Networks

Authors: Stefan Ropke | Jean‐François Cordeau | Gilbert Laporte

https://doi.org/10.1002/net.20177 Actions
Feedback: support@crossref.org