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 *

116 related articles for article (PubMed ID: 31258249)

  • 1. Decomposition methods for the two-stage stochastic Steiner tree problem.
    Leitner M; Ljubić I; Luipersbeck M; Sinnl M
    Comput Optim Appl; 2018; 69(3):713-752. PubMed ID: 31258249
    [TBL] [Abstract][Full Text] [Related]  

  • 2. MIP models for connected facility location: A theoretical and computational study.
    Gollowitzer S; Ljubić I
    Comput Oper Res; 2011 Feb; 38(2):435-449. PubMed ID: 25009366
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem.
    Parragh SN; Tricoire F; Gutjahr WJ
    OR Spectr; 2022; 44(2):419-459. PubMed ID: 35673526
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs.
    Biazzo I; Braunstein A; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Aug; 86(2 Pt 2):026706. PubMed ID: 23005881
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Hybrid evolutionary optimization of two-stage stochastic integer programming problems: an empirical investigation.
    Tometzki T; Engell S
    Evol Comput; 2009; 17(4):511-26. PubMed ID: 19916776
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A note on computational approaches for the antibandwidth problem.
    Sinnl M
    Cent Eur J Oper Res; 2021; 29(3):1057-1077. PubMed ID: 34776784
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Parallel Subgradient Algorithm with Block Dual Decomposition for Large-scale Optimization.
    Zheng Y; Xie Y; Lee I; Dehghanian A; Serban N
    Eur J Oper Res; 2022 May; 299(1):60-74. PubMed ID: 35035056
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.
    Gaar E; Rendl F
    Math Program; 2020; 183(1):283-308. PubMed ID: 32863433
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Determining locations and layouts for parcel lockers to support supply chain viability at the last mile.
    Kahr M
    Omega; 2022 Dec; 113():102721. PubMed ID: 35875464
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Lower and upper bounds for the two-echelon capacitated location-routing problem.
    Contardo C; Hemmelmayr V; Crainic TG
    Comput Oper Res; 2012 Dec; 39(12):3185-3199. PubMed ID: 24511176
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Exact solution approaches for the discrete
    Gaar E; Sinnl M
    Networks (N Y); 2023 Dec; 82(4):371-399. PubMed ID: 38529259
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Instance dataset for a multiprocessor scheduling problem with multiple time windows and time lags: Similar instances with large differences in difficulty.
    Karlsson E; Rönnberg E
    Data Brief; 2022 Dec; 45():108687. PubMed ID: 36426038
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A Two-Stage Location Problem with Order Solved Using a Lagrangian Algorithm and Stochastic Programming for a Potential Use in COVID-19 Vaccination Based on Sensor-Related Data.
    Cabezas X; García S; Martin-Barreiro C; Delgado E; Leiva V
    Sensors (Basel); 2021 Aug; 21(16):. PubMed ID: 34450794
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Antilope--a Lagrangian relaxation approach to the de novo peptide sequencing problem.
    Andreotti S; Klau GW; Reinert K
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):385-94. PubMed ID: 21464512
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Speeding up the core algorithm for the dual calculation of minimal cut sets in large metabolic networks.
    Klamt S; Mahadevan R; von Kamp A
    BMC Bioinformatics; 2020 Nov; 21(1):510. PubMed ID: 33167871
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Optimal Access Point Power Management for Green IEEE 802.11 Networks.
    Garroppo RG; Nencioni G; Tavanti L; Gendron B; Scutellà MG
    Sensors (Basel); 2021 Mar; 21(6):. PubMed ID: 33809509
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.