The mixed general routing polyhedronCORBERAN, A; ROMERO, A; SANCHIS, J. M et al.Mathematical programming. 2003, Vol 96, Num 1, pp 103-137, issn 0025-5610, 35 p.Article

DEAR: A Device and Energy Aware Routing protocol for heterogeneous ad hoc networksAVUDAINAYAGAM, Arun; WENJING LOU; YUGUANG FANG et al.Journal of parallel and distributed computing (Print). 2003, Vol 63, Num 2, pp 228-236, issn 0743-7315, 9 p.Article

Exact methods based on node-routing formulations for undirected arc-routing problemsBALDACCI, R; MANIEZZO, V.Networks (New York, NY). 2005, Vol 47, Num 1, pp 52-60, issn 0028-3045, 9 p.Article

Routing through a dense channel with minimum total wire lengthFORMANN, M; WAGNER, D; WAGNER, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 267-283, issn 0196-6774Article

Compatibility between Three Well-Known Broadcast Tree Construction Algorithms and Various MetricsCHUAN HAN; YALING YANG.IEEE transactions on mobile computing. 2011, Vol 10, Num 8, pp 1187-1199, issn 1536-1233, 13 p.Article

Research challenges in QoS routing : Networks of excellenceMASIP-BRUIN, X; YANNUZZI, M; ARANDA-GUTIERREZ, P et al.Computer communications. 2006, Vol 29, Num 5, pp 563-581, issn 0140-3664, 19 p.Conference Paper

Some recent contributions to routing and location problemsCORBERAN, A; MOTA, E; SALAZAR, J. J et al.Networks (New York, NY). 2003, Vol 42, Num 2, pp 109-113, issn 0028-3045, 5 p.Article

A lower bound for the Node, Edge, and Arc Routing ProblemBACH, Lukas; HASLE, Geir; WØHLK, Sanne et al.Computers & operations research. 2013, Vol 40, Num 4, pp 943-952, issn 0305-0548, 10 p.Article

Compact inter-domain routing under real-world constraintsWINTER, Rolf.Annales des télécommunications. 2011, Vol 66, Num 1-2, pp 45-57, issn 0003-4347, 13 p.Article

A new tabu search heuristic for the open vehicle routing problemFU, Z; EGLESE, R; LYO, Li et al.The Journal of the Operational Research Society. 2005, Vol 56, Num 3, pp 267-274, issn 0160-5682, 8 p.Article

Multiple path routing algorithm for IP networksRIOS, Miguel; MARIANOV, Vladimir; AVAGLIANO, Andres et al.Computer communications. 2005, Vol 28, Num 7, pp 829-836, issn 0140-3664, 8 p.Article

Compact policy routingRETVARI, Gábor; GULYAS, András; HESZBERGER, Zalán et al.Distributed computing. 2013, Vol 26, Num 5-6, pp 309-320, issn 0178-2770, 12 p.Article

A self-adaptive zone routing protocol for Bluetooth scatternetsHUANG, Chenn-Jung; LAI, Wei-Kuang; HSIAO, Sheng-Yu et al.Computer communications. 2005, Vol 28, Num 1, pp 37-50, issn 0140-3664, 14 p.Article

The efficacy of exclusive territory assignments to delivery vehicle driversHAUGHTON, Michael A.European journal of operational research. 2007, Vol 184, Num 1, pp 24-38, issn 0377-2217, 15 p.Article

Forty Years of Periodic Vehicle RoutingCAMPBELL, Ann Melissa; WILSON, Jill Hardin.Networks (New York, NY). 2014, Vol 63, Num 1, pp 2-15, issn 0028-3045, 14 p.Conference Paper

Competitive analysis of a dispatch policy for a dynamic multi-period routing problemANGELELLI, Enrico; SAVELSBERGH, Martin W. P; GRAZIA SPERANZA, M et al.Operations research letters. 2007, Vol 35, Num 6, pp 713-721, issn 0167-6377, 9 p.Article

An approximation algorithm for the pickup and delivery vehicle routing problem on treesKATOH, Naoki; YANO, Taihei.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2335-2349, issn 0166-218X, 15 p.Conference Paper

The turn model for adaptive routingGLASS, C. J; NI, L. M.Journal of the Association for Computing Machinery. 1994, Vol 41, Num 5, pp 874-902, issn 0004-5411Article

Optimal Routing by the Intermediate Model- Joining the Pipe and Hose ModelsOKI, Eiji; IWAKI, Ayako.IEICE transactions on communications. 2009, Vol 92, Num 10, pp 3247-3251, issn 0916-8516, 5 p.Article

A secure alternate path routing in sensor networksLEE, Suk-Bok; CHOI, Yoon-Hwa.Computer communications. 2006, Vol 30, Num 1, pp 153-165, issn 0140-3664, 13 p.Article

Enforcing convergence in inter-domain routingCOBB, Jorge A; MUSUNURI, Ravi.IEEE Global Telecommunications Conference. 2004, pp 1353-1358, isbn 0-7803-8794-5, 6 p.Conference Paper

Optimum multi-dimensional interval routing schemes on networks with dynamic cost linksGANJALI, Yashar.Computing and informatics. 2003, Vol 22, Num 1, pp 1-17, issn 1335-9150, 17 p.Article

Minimizing recovery overhead in geographic ad hoc routingJONGKEUN NA; KIM, Young-Jin; GOVINDAN, Ramesh et al.Computer communications. 2010, Vol 33, Num 11, pp 1343-1353, issn 0140-3664, 11 p.Article

Algorithms for static and dynamic group multicast routing under bandwidth constraints : Computer and communication networksTSAI, Kun-Cheng; CHYOUHWA CHEN.Journal of information science and engineering. 2005, Vol 21, Num 3, pp 495-527, issn 1016-2364, 33 p.Article

Fame-Based Probabilistic Routing for Delay-Tolerant NetworksSHIN, Kwangcheol; LEE, Dongman.IEICE transactions on communications. 2010, Vol 93, Num 6, pp 1451-1458, issn 0916-8516, 8 p.Article