The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences

European Journal of Operational Research

Volumn 248, Issue 2, 2016, Pages 668-680

  Maher, Stephen J ^a,b   Murray, John M ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Acceleration techniques; Benders' decomposition; HIV Env sequence; OR in medicine

Indexed keywords

COMPLEX NETWORKS; HEURISTIC METHODS; OPERATIONS RESEARCH;

ACCELERATION TECHNIQUE; BENDERS' DECOMPOSITIONS; COVARIANCE NETWORKS; HEURISTIC APPROACH; HIV ENV SEQUENCE; NETWORK FLOW PROBLEMS; NOVEL APPLICATIONS; SET COVERING PROBLEM;

INTEGER PROGRAMMING;

EID: 84942292984     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.07.011     Document Type: Article

References (22)

1. Abrahams M.-R., Anderson J.A., Giorgi E.E., Seoighe C., Mlisana K., Ping L.-H., and et al. For the CAPRISA acute infection study team the center for HIV-AIDS vaccine immunology consortium. Quantitating the multiplicity of infection with human immunodeficiency virus type 1 subtype c reveals a non-poisson distribution of transmitted variants Journal of Virology 83 8 2009 3556 3567 10.1128/JVI.02132-08
2. Ahuja R., Magnanti T., and Orlin J. Network flows: theory, algorithms, and applications 1993 Prentice Hall
3. Álvarez Miranda E., Ljubić I., and Mutzel P. The rooted maximum node-weight connected subgraph problem C. Gomes, M. Sellmann, Proceedings of the Integration of ai and or techniques in constraint programming for combinatorial optimization problems Lecture Notes in Computer Science 7874 2013 Springer Berlin Heidelberg 300 315 10.1007/978-3-642-38171-3-20
4. Aurora R., Donlin M., Cannon N., Tavis J., and et al. Genome-wide hepatitis C virus amino acid covariance networks can predict response to antiviral therapy in humans. The Journal of clinical investigation 119 1 2009 225 236
5. Backes C., Rurainski A., Klau G.W., Müller O., Stöckel D., Gerasch A., and et al. An integer linear programming approach for finding deregulated subgraphs in regulatory networks Nucleic Acids Research 40 6 2012 e43 10.1093/nar/gkr1227
6. Carvajal R., Constantino M., Goycoolea M., Vielma J.P., and Weintraub A. Imposing connectivity constraints in forest planning models Operations Research 61 4 2013 824 836
7. Conrad J.M., Gomes C.P., van Hoeve W.-J., Sabharwal A., and Suter J.F. Connections in networks: hardness of feasibility versus optimality P. Hentenryck, L. Wolsey, Integration of ai and or techniques in constraint programming for combinatorial optimization problems Lecture Notes in Computer Science 4510 2007 Springer Berlin Heidelberg 16 28 10.1007/978-3-540-72397-4-2
8. Conrad J.M., Gomes C.P., van Hoeve W.-J., Sabharwal A., and Suter J.F. Wildlife corridors as a connected subgraph problem Journal of Environmental Economics and Management 63 1 2012 1 18 http://dx.doi.org/10.1016/j.jeem.2011.08.001
9. Dilkina B., and Gomes C.P. Solving connected subgraph problems in wildlife conservation A. Lodi, M. Milano, P. Toth, Proceedings of the Integration of ai and or techniques in constraint programming for combinatorial optimization problems Lecture Notes in Computer Science 6140 2010 Springer Berlin Heidelberg 102 116 10.1007/978-3-642-13520-0-14
10. Dittrich M.T., Klau G.W., Rosenwald A., Dandekar T., and Müller T. Identifying functional modules in protein-protein interaction networks: an integrated exact approach Bioinformatics 24 13 2008 i223 i231 10.1093/bioinformatics/btn161
11. Gnanakaran S., Bhattacharya T., Daniels M., Keele B.F., Hraber P.T., Lapedes A.S., and et al. Recurrent signature patterns in HIV-1 B clade envelope glycoproteins associated with either early or chronic infections PLoS Pathogens 7 9 2011 e1002209 10.1371/journal.ppat.1002209
12. Gomes C.P., van Hoeve W.-J., and Sabharwal A. Connections in networks: a hybrid approach L. Perron, M. Trick, Proceedings of the Integration of ai and or techniques in constraint programming for combinatorial optimization problems Lecture Notes in Computer Science 5015 2008 Springer Berlin Heidelberg 303 307 10.1007/978-3-540-68155-7-27
13. Keele B.F., Giorgi E.E., Salazar-Gonzalez J.F., Decker J.M., Pham K.T., Salazar M.G., and et al. Identification and characterization of transmitted and early founder virus envelopes in primary hiv-1 infection Proceedings of the National Academy of Sciences 105 21 2008 7552 7557 10.1073/pnas.0802203105
14. Linderoth J., and Wright S. Decomposition algorithms for stochastic programming on a computational grid Computational Optimization and Applications 24 2-3 2003 207 250 10.1023/A:1021858008222
15. Mota T.M., Murray J.M., Center R.J., Purcell D.F.J., and McCaw J.M. Application of a case-control study design to investigate genotypic signatures of HIV-1 transmission Retrovirology 9 1 2012 1 12 10.1186/1742-4690-9-54
16. Murray, J. M., Maher, S. J., Mota, T. M., Center, R. J., Suzuki, K., Kelleher, A., & et al. (2015). Differentiating founder and chronic HIV sequences. Submitted for publication.
17. Murray J.M., Moenne-Loccoz R., Velay A., Habersetzer F., Doffol M., Gut J.-P., and et al. Genotype 1 hepatitis C virus envelope features that determine antiviral response assessed through optimal covariance networks PLoS ONE 8 6 2013 e67254 10.1371/journal.pone.0067254
18. Önal H., and Briers R.A. Designing a conservation reserve network with minimal fragmentation: a linear integer programming approach Environmental Modeling & Assessment 10 3 2005 193 202 10.1007/s10666-005-9009-3
19. Önal H., and Briers R.A. Optimal selection of a connected reserve network Operations Research 54 2 2006 379 388 10.1287/opre.1060.0272
20. Önal H., and Wang Y. A graph theory approach for designing conservation reserve networks with minimal fragmentation Networks 51 2 2008 142 152 10.1002/net.20211
21. Ruszczyński A. A regularized decomposition method for minimizing a sum of polyhedral functions Mathematical Programming 35 3 1986 309 333 10.1007/BF01580883
22. Santoso T., Ahmed S., Goetschalckx M., and Shapiro A. A stochastic programming approach for supply chain network design under uncertainty European Journal of Operational Research 167 1 2005 96 115 10.1016/j.ejor.2004.01.046