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

DOI10.1016/j.ejor.2015.07.011zbMath1346.90852OpenAlexW815683020MaRDI QIDQ320748

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

OR in medicineBenders' decompositionacceleration techniquesHIV sequence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Wildlife corridors as a connected subgraph problem
• Decomposition algorithms for stochastic programming on a computational grid
• A stochastic programming approach for supply chain network design under uncertainty
• Optimal Selection of a Connected Reserve Network
• Solving Connected Subgraph Problems in Wildlife Conservation
• Connections in Networks: Hardness of Feasibility Versus Optimality
• A regularized decomposition method for minimizing a sum of polyhedral functions
• The Rooted Maximum Node-Weight Connected Subgraph Problem
• Imposing Connectivity Constraints in Forest Planning Models
• A graph theory approach for designing conservation reserve networks with minimal fragmentation

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