While integer programming and metaheuristics such as VLSN search were extremely useful in our applied research, our project also focused considerable time on fundamental research. We obtained significant advancement in network flows ([57,36]), in TSP([3,4]) and in establishing tight performance bounds on various classes of vertex cover problems [29,30],. The approximation results in vehicle routing problems, network facility location problems and wireless coverage problems are separately discussed below.