NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.073 seconds)

Spelling suggestions: "subject:"path coverage 3structure"" "subject:"path coverage bstructure""

1

Shortest Path - Capacitated Maximum Covering Problems

Hua, Liyan 03 September 2010 (has links)
No description available.
Management
Operations Research
Shortest Path
Capacitated Maximum Covering Problem
Decomposition
Tabu Search
Simulated Annealing
Path Coverage Structure
Tree

Page generated in 0.0771 seconds