Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"postman problems"”.

  1. Postman Problems on Mixed Graphs

    The <i>mixed postman problem</i> consists of finding a minimum cost tour of a mixed graph <i>M</i> = (<i>V</i>,<i>E</i>,<i>A</i>) traversing all its edges and arcs at least once. We prove that two well-known linear programming relaxations of this problem are equivalent. The <i>extra cost</i> of a …

    waterloo Repository record for Postman Problems on Mixed Graphs (opens in a new tab)

  2. Wireless sensor network aided search and rescue in trails

    … is minimized. Particularly, we address two problems: a) how to identify the lost hiker position as accurately as possible, i.e., obtain a small search region containing the lost hiker; and (b) how to search efficiently in search regions for different trail topologies and search agent …

    missouri Repository record for Wireless sensor network aided search and rescue in trails (opens in a new tab)

  3. Modeling and Solving Arc Routing Problems in Street Sweeping and Snow Plowing

    In arc routing problems, the goal is to determine an optimal path, or set of paths, that traverse a required subset of arcs on a graph with respect to a set of constraints and objective function. The Chinese Postman Problem (CPP) forms the basis for many arc routing problems. Let graph G =(V,A), …

    maryland Repository record for Modeling and Solving Arc Routing Problems in Street Sweeping and Snow Plowing (opens in a new tab)