A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Phone: (210) 458-5777 Fax: (210) 458-6350 firstname.lastname@example.org http://faculty.business.utsa.edu/msun Abstract In many applications of multiple objective network programming problems, only integer solutions are acceptable as the final optimal solution. Representative efficient solutions are usually obtained by sampling the efficient set through the solution of augmented weighted Tchebycheff network programs. Because such efficient solutions are usually not integer solutions, a branch-and-bounddoi:10.1002/net.21493 fatcat:bwigsnvt2jgfxajvwsfmseqtdq