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 *

98 related articles for article (PubMed ID: 31258229)

  • 1. The two-region multi-depot pickup and delivery problem.
    Soriano A; Gansterer M; Hartl RF
    OR Spectr; 2018; 40(4):1077-1108. PubMed ID: 31258229
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Assignment constraints in shared transportation services.
    Gansterer M; Hartl RF; Wieser S
    Ann Oper Res; 2021; 305(1-2):513-539. PubMed ID: 34720318
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Exact solutions for the collaborative pickup and delivery problem.
    Gansterer M; Hartl RF; Salzmann PEH
    Cent Eur J Oper Res; 2018; 26(2):357-371. PubMed ID: 29773966
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 9. Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search.
    Turkeš R; Sörensen K; Hvattum LM; Barrena E; Chentli H; Coelho LC; Dayarian I; Grimault A; Gullhav AN; Iris Ç; Keskin M; Kiefer A; Lusby RM; Mauri GR; Monroy-Licht M; Parragh SN; Riquelme-Rodríguez JP; Santini A; Santos VGM; Thomas C
    Data Brief; 2020 Dec; 33():106568. PubMed ID: 33304965
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Adaptive Replacement Strategies for MOEA/D.
    Wang Z; Zhang Q; Zhou A; Gong M; Jiao L
    IEEE Trans Cybern; 2016 Feb; 46(2):474-86. PubMed ID: 25826813
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm.
    Mofid-Nakhaee E; Barzinpour F
    Waste Manag Res; 2019 Jan; 37(1):38-47. PubMed ID: 30319052
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
    Miao K; Duan H; Qian F; Dong Y
    PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 16. An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem.
    Lusby RM; Schwierz M; Range TM; Larsen J
    Artif Intell Med; 2016 Nov; 74():21-31. PubMed ID: 27964800
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning.
    Zhang Z; Liu H; Zhou M; Wang J
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2119-2132. PubMed ID: 34520362
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost.
    Bae J; Chung W
    Sensors (Basel); 2019 May; 19(11):. PubMed ID: 31146430
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Hybridization of decomposition and local search for multiobjective optimization.
    Ke L; Zhang Q; Battiti R
    IEEE Trans Cybern; 2014 Oct; 44(10):1808-20. PubMed ID: 25222724
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.