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

DOI10.1016/J.EJOR.2015.07.011MaRDI QIDQ320748zbMATH OpenOpenAlexFDO

Authors Stephen J. Maher, John M. Murray

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10871/39958

zbMATH Keywords

acceleration techniquesBenders' decompositionHIV sequenceOR in medicine

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Genetics and epigenetics (92D10)

Recommendations

• Optimizing experimental design in genetics
• A scalable engineering combination therapies for evolutionary dynamic of macrophages
• Some statistical methods for phylogenetic trees with application to HIV disease
• Branch and cut methods for network optimization
• Efficient Haplotype Inference with Pseudo-boolean Optimization

Cites work

• A graph theory approach for designing conservation reserve networks with minimal fragmentation
• A regularized decomposition method for minimizing a sum of polyhedral functions
• A stochastic programming approach for supply chain network design under uncertainty
• Connections in Networks: Hardness of Feasibility Versus Optimality
• Decomposition algorithms for stochastic programming on a computational grid
• Imposing Connectivity Constraints in Forest Planning Models
• Network flows. Theory, algorithms, and applications.
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• The rooted maximum node-weight connected subgraph problem
• Wildlife corridors as a connected subgraph problem

This page was built for publication: The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320748)