## Integer Programming and Combinatorial Optimization: 4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings, Volume 4The optimistic predictions of a number of microbiologists notwithstanding, the past decade has not signaled the end of infectious disease, but rather an introduction to a host of new and complex microorganisms and their resulting depredations on humanity. The identification of new pathogens, such as the causative agent of Lyme disease and the Human Immuno-deficiency Virus (HIV), as well as the Hepatitis Delta Virus (HDV) has not only revealed new forms of clinical pathology, but new and unexpected variations on the life cycle and the molecular biology of the pathogens. In this volume a number of the leaders in the field of Hepatitis Delta virus research, ranging from clinicians and virologists to molecular biologists and biochemists describe what in their experience typifies some of these unique features. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Integer Programming and Combinatorial Optimization: 4th ..., Volume 4 Egon Balas,Jens Clausen No preview available - 1995 |

Integer Programming and Combinatorial Optimization Egon Balas,Jens Clausen No preview available - 2014 |

### Common terms and phrases

0-1 program approximation arborescence arcs assume augmenting circuit augmenting path batches binary clutter bipartition inequality Claim clique cocycle coefficients cographic column combinatorial completion computational conjecture consider constraints contains convex convex hull Corollary corresponding cycle defined delta-matroid denote digraph disjoint dynamic flow edges Euler tour exists facet feasible solution feedback vertex set flow problem formulation fractional function given graph G greedy algorithm Hence heuristic Hilbert ideal implies in-tight set integer programming intersection interval order iteration knapsack Knapsack Problem Lagrangian lattice Lemma Let G linear programming matching Mathematics matrix maximal maximum minimally non-ideal node obtained optimal solution oriented matroid out-tight packing pair partition partitioning problem path polyhedral polyhedron polynomial polytope Proof Proposition prove random relabeling relaxation satisfies scheduling Section series-parallel graphs signable solved subgraph subset supermodular Theorem upper bound valid inequalities variables vector vertex vertices weight

### Popular passages

Page 413 - D. Naor, D. Gusfield and C. Martel. A fast algorithm for optimally increasing the edge-connectivity.