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 *

345 related articles for article (PubMed ID: 31258236)

  • 1. Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.
    Laesanklang W; Landa-Silva D
    Ann Oper Res; 2017; 256(1):93-127. PubMed ID: 31258236
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A model for solving the prescribed burn planning problem.
    Rachmawati R; Ozlen M; Reinke KJ; Hearne JW
    Springerplus; 2015; 4():630. PubMed ID: 26543764
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A heuristic approach to the task planning problem in a home care business.
    Méndez-Fernández I; Lorenzo-Freire S; García-Jurado I; Costa J; Carpente L
    Health Care Manag Sci; 2020 Dec; 23(4):556-570. PubMed ID: 32712791
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports.
    Salhi A; Alsoufi G; Yang X
    Ann Oper Res; 2019; 272(1):69-98. PubMed ID: 30880858
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Hybrid Heuristic-Exact Optimization for Large-Scale Home Health Care Problem.
    Zhu X; Zou M; Liu D; Wang J; Tang J; Bao W
    IEEE/ACM Trans Comput Biol Bioinform; 2024; 21(4):1129-1140. PubMed ID: 37878430
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Efficient Minimum Flow Decomposition via Integer Linear Programming.
    Dias FHC; Williams L; Mumey B; Tomescu AI
    J Comput Biol; 2022 Nov; 29(11):1252-1267. PubMed ID: 36260412
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A clustering metaheuristic for large orienteering problems.
    Elzein A; Di Caro GA
    PLoS One; 2022; 17(7):e0271751. PubMed ID: 35867693
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
    Chen X; Kong Y; Dang L; Hou Y; Ye X
    PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A heuristic algorithm for medical staff's scheduling problems with multiskills and vacation control.
    You PS; Hsieh YC
    Sci Prog; 2021 Sep; 104(3_suppl):368504211050301. PubMed ID: 34661485
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Home care vehicle routing problem with chargeable overtime and strict and soft preference matching.
    Malagodi L; Lanzarone E; Matta A
    Health Care Manag Sci; 2021 Mar; 24(1):140-159. PubMed ID: 33483910
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Surrogate "Level-Based" Lagrangian Relaxation for mixed-integer linear programming.
    Bragin MA; Tucker EL
    Sci Rep; 2022 Dec; 12(1):22417. PubMed ID: 36575204
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Exact integer linear programming solvers outperform simulated annealing for solving conservation planning problems.
    Schuster R; Hanson JO; Strimas-Mackey M; Bennett JR
    PeerJ; 2020; 8():e9258. PubMed ID: 32518737
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Scheduling deferrable electric appliances in smart homes: a bi-objective stochastic optimization approach.
    Rossit DG; Nesmachnow S; Toutouh J; Luna F
    Math Biosci Eng; 2022 Jan; 19(1):34-65. PubMed ID: 34902979
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Exact and heuristic approaches for multi-objective garbage accumulation points location in real scenarios.
    Rossit DG; Toutouh J; Nesmachnow S
    Waste Manag; 2020 Mar; 105():467-481. PubMed ID: 32135468
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016).
    Chen PH
    Appl Psychol Meas; 2017 May; 41(3):227-240. PubMed ID: 29881090
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem.
    Fajemisin AO; Climent L; Prestwich SD
    OR Spectr; 2021; 43(3):665-692. PubMed ID: 34776568
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems.
    Cheng L; Feng L; Li Z
    Sci Prog; 2021; 104(3):368504211030833. PubMed ID: 34292845
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A Hybrid Algorithm of Ant Colony and Benders Decomposition for Large-Scale Mixed Integer Linear Programming.
    Shan T; Qiu Z
    Comput Intell Neurosci; 2022; 2022():1634995. PubMed ID: 36093475
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 18.