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 *

109 related articles for article (PubMed ID: 33425039)

  • 1. A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak.
    Jiang L; Zang X; Dong J; Liang C; Mladenovic N
    Optim Lett; 2022; 16(1):333-353. PubMed ID: 33425039
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method.
    Sutrisno H; Yang CL
    Ann Oper Res; 2023; 323(1-2):203-228. PubMed ID: 36710941
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Drone routing problem model for last-mile delivery using the public transportation capacity as moving charging stations.
    Moadab A; Farajzadeh F; Fatahi Valilai O
    Sci Rep; 2022 Apr; 12(1):6361. PubMed ID: 35428789
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.
    Bula GA; Prodhon C; Gonzalez FA; Afsar HM; Velasco N
    J Hazard Mater; 2017 Feb; 324(Pt B):472-480. PubMed ID: 27876240
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 6. A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm.
    Cui S; Sun Q; Zhang Q
    Comput Intell Neurosci; 2022; 2022():5099008. PubMed ID: 35990156
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm.
    Kohar A; Jakhar SK
    Ann Oper Res; 2021 Jun; ():1-22. PubMed ID: 34131357
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The adoption of self-driving delivery robots in last mile logistics.
    Chen C; Demir E; Huang Y; Qiu R
    Transp Res E Logist Transp Rev; 2021 Feb; 146():102214. PubMed ID: 35002468
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Production routing in perishable and quality degradable supply chains.
    Manouchehri F; Nookabadi AS; Kadivar M
    Heliyon; 2020 Feb; 6(2):e03376. PubMed ID: 32095648
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Stackelberg Security Game for Adversarial Outbreak Detection in the Internet of Things.
    Chen L; Wang Z; Li F; Guo Y; Geng K
    Sensors (Basel); 2020 Feb; 20(3):. PubMed ID: 32024201
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Time-constrained maximal covering routing problem.
    Amiri A; Salari M
    OR Spectr; 2019; 41(2):415-468. PubMed ID: 32214572
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.
    Hemmelmayr VC; Cordeau JF; Crainic TG
    Comput Oper Res; 2012 Dec; 39(12):3215-3228. PubMed ID: 23483764
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Assessing last-mile distribution resilience under demand disruptions.
    Pahwa A; Jaller M
    Transp Res E Logist Transp Rev; 2023 Apr; 172():103066. PubMed ID: 36844256
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Hybrid column generation and large neighborhood search for the dial-a-ride problem.
    Parragh SN; Schmid V
    Comput Oper Res; 2013 Jan; 40(1):490-497. PubMed ID: 23471127
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Optimization and profit distribution in a two-echelon collaborative waste collection routing problem from economic and environmental perspective.
    Liu L; Liao W
    Waste Manag; 2021 Feb; 120():400-414. PubMed ID: 33127279
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. A Balanced Algorithm for In-City Parking Allocation: A Case Study of Al Madinah City.
    Abdeen MAR; Nemer IA; Sheltami TR
    Sensors (Basel); 2021 May; 21(9):. PubMed ID: 34062872
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A set-covering based heuristic algorithm for the periodic vehicle routing problem.
    Cacchiani V; Hemmelmayr VC; Tricoire F
    Discrete Appl Math; 2014 Jan; 163(Pt 1):53-64. PubMed ID: 24748696
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.
    Xia Y; Fu Z; Pan L; Duan F
    PLoS One; 2018; 13(5):e0195457. PubMed ID: 29763419
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.