These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

194 related articles for article (PubMed ID: 27876240)

  • 21. A two-echelon location routing problem considering sustainability and hybrid open and closed routes under uncertainty.
    Hajghani M; Forghani MA; Heidari A; Khalilzadeh M; Kebriyaii O
    Heliyon; 2023 Mar; 9(3):e14258. PubMed ID: 36950583
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Heterogeneous fleet recyclables collection routing optimization in a two-echelon collaborative reverse logistics network from circular economic and environmental perspective.
    Cao S; Liao W; Huang Y
    Sci Total Environ; 2021 Mar; 758():144062. PubMed ID: 33333310
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Hazardous materials transportation: a risk-analysis-based routing methodology.
    Leonelli P; Bonvicini S; Spadoni G
    J Hazard Mater; 2000 Jan; 71(1-3):283-300. PubMed ID: 10677666
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle.
    Luo Z; Liu Z; Shi J
    Sensors (Basel); 2017 May; 17(5):. PubMed ID: 28513552
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.
    Xia Y; Fu Z; Tsai SB; Wang J
    Int J Environ Res Public Health; 2018 May; 15(5):. PubMed ID: 29747469
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs.
    Fröhlich GEA; Doerner KF; Gansterer M
    Networks (N Y); 2020 Dec; 76(4):431-450. PubMed ID: 33328694
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.
    Li-Ning Xing ; Rohlfshagen P; Ying-Wu Chen ; Xin Yao
    IEEE Trans Syst Man Cybern B Cybern; 2011 Aug; 41(4):1110-23. PubMed ID: 21324786
    [TBL] [Abstract][Full Text] [Related]  

  • 28. A multiobjective model for the green capacitated location-routing problem considering drivers' satisfaction and time window with uncertain demand.
    Alamatsaz K; Ahmadi A; Mirzapour Al-E-Hashem SMJ
    Environ Sci Pollut Res Int; 2022 Jan; 29(4):5052-5071. PubMed ID: 34415526
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem.
    Lahyani R; Coelho LC; Renaud J
    OR Spectr; 2018; 40(1):125-157. PubMed ID: 31274942
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Optimization of Wood Supply: The Forestry Routing Optimization Model.
    Monti CAU; Gomide LR; Oliveira RM; FranÇa LCJ
    An Acad Bras Cienc; 2020; 92(3):e20200263. PubMed ID: 33175016
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A multimodal location and routing model for hazardous materials transportation.
    Xie Y; Lu W; Wang W; Quadrifoglio L
    J Hazard Mater; 2012 Aug; 227-228():135-41. PubMed ID: 22633882
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Robust dual sourcing inventory routing optimization for disaster relief.
    Zheng W; Zhou H
    PLoS One; 2023; 18(4):e0284971. PubMed ID: 37104462
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Solving Generalized Vehicle Routing Problem With Occasional Drivers via Evolutionary Multitasking.
    Feng L; Zhou L; Gupta A; Zhong J; Zhu Z; Tan KC; Qin K
    IEEE Trans Cybern; 2021 Jun; 51(6):3171-3184. PubMed ID: 31871003
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Algorithms for Smooth, Safe and Quick Routing on Sensor-Equipped Grid Networks.
    Andreatta G; De Francesco C; De Giovanni L
    Sensors (Basel); 2021 Dec; 21(24):. PubMed ID: 34960283
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths.
    Qi X; Fu Z; Xiong J; Zha W
    PLoS One; 2020; 15(2):e0227702. PubMed ID: 32027655
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Memory-based variable neighborhood search for green vehicle routing problem with passing-by drivers: a comprehensive perspective.
    Cao L; Ye CM; Cheng R; Wang ZK
    Complex Intell Systems; 2022; 8(3):2507-2525. PubMed ID: 35155081
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.
    Osaba E
    Data Brief; 2020 Apr; 29():105142. PubMed ID: 32055657
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A trilevel
    Hesam Sadati ME; Aksen D; Aras N
    Comput Oper Res; 2020 Nov; 123():104996. PubMed ID: 32834370
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Clustering-based iterative heuristic framework for a non-emergency patients transportation problem.
    Nasir JA; Kuo YH; Cheng R
    J Transp Health; 2022 Sep; 26():101411. PubMed ID: 35966904
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports.
    Schilde M; Doerner KF; Hartl RF
    Comput Oper Res; 2011 Dec; 38(12):1719-1730. PubMed ID: 23543641
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 10.