Connections in networks: A hybrid approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5015 LNCS, Issue , 2008, Pages 303-307

  Gomes, Carla P ^a   Van Hoeve, Willem Jan ^b   Sabharwal, Ashish ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMALS; CONSTRAINED OPTIMIZATION; SCALABILITY; SCHEDULING;

CONNECTION SUBGRAPH PROBLEM; CPLEX; HYBRID SOLUTION METHOD;

PROBLEM SOLVING;

EID: 44649111994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68155-7_27     Document Type: Conference Paper

References (4)

1. CERI. Grizzly bear habitat sustainability data, Craighead Environmental Research Institute, Bozeman, MT (2007)
2. Conrad, J., Gomes, C.P., van Hoeve, W.-.J., Sabharwal, A., Suter, J.: Connections in networks: Hardness of feasibility versus optimality. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 16-28. Springer, Heidelberg (2007)
3. ILOG, SA. CPLEX 10.1 reference manual (2006)
4. Prömel, H.J., Steger, A.: The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity. Vieweg (2002)