In this paper we discuss valid inequalities for the directed hop-constrained shortest path problem. We give complete linear characterizations of the hop-constrained path polytope when the maximumâ€¦ (More)

We present a cutting plane algorithm for solving the following network design problem in telecommunications: given point-to-point trafc demands in a network, speci ed survivability requirements and aâ€¦ (More)

We study the dominant of the convex hull of st-paths with at most k edges in a graph. A complete linear description is obtained for k â‰¤ 3 and a class of facet de ning inequalities for k â‰¥ 4 is given.

IEEE Transactions on Ultrasonics, Ferroelectricsâ€¦

1997

Theory for random arrays predicts a mean sidelobe level given by the inverse of the number of elements. In practice, however, the sidelobe level fluctuates much around this mean. In this paper twoâ€¦ (More)

We study the stable set polytope P (Gn) for the graph Gn with n nodes and edges [i, j] when |iâˆ’j| â‰¤ 2 (using modulo n calculation); this graph coincides with the anti-web WÌ„ (n,3). A minimal linearâ€¦ (More)

A hop-constrained walk is a walk with at most H arcs. The cases H6 3 have been addressed previously. Here, we consider the case H = 4. We present an extended formulation for 4-walks and use theâ€¦ (More)

We study a network connguration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traac demand. The problem is formulated asâ€¦ (More)

The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost subgraph such that between two given nodes s and t there exist at least k edge-disjoint paths of at most 2â€¦ (More)