Text

A branch and bound algorithm for solving the truck dispatching problem

About this Digital Document

The Truck Dispatching Problem is a special form of the well known Traveling Salesman Problem. No analytical solution that will guarantee an optimal solution to this problem is known to exist. This thesis solves the Truck Dispatching Problem by a Branch and Bound technique.
Full Title
A branch and bound algorithm for solving the truck dispatching problem
Member of
Theses and Dissertations
Contributor(s)
Creator: Brokke, Harris M.
Thesis advisor: Carroll, John M.
Publisher
Lehigh University
Date Issued
1968-04
Language
English
Type
Text
Genre
theses
Form
electronic documents
Department name
Industrial Engineering
Digital Format
electronic documents
Media type
application/pdf
Creator role
Graduate Student
Identifier
1048261711
https://asa.lib.lehigh.edu/Record/10946933
Keywords
Industrial engineering
Brokke, . H. M. (1968). A branch and bound algorithm for solving the truck dispatching problem (1–). https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/branch-bound
Brokke, Harris M. 1968. “A Branch and Bound Algorithm for Solving the Truck Dispatching Problem”. https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/branch-bound.
Brokke, Harris M. A Branch and Bound Algorithm for Solving the Truck Dispatching Problem. Apr. 1968, https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/branch-bound.