Unformatted text preview: Methods of upper and lower bounding A method of checking feasibility A branching rule A search strategy You should discuss what data structures would be necessary to implement your algorithm, including the graph representation, representation of the search nodes, and data structures for upper and lower bounding. 2. Show that the set of all 1trees on a graph G is a matroid. There are two different methods of showing this. Use either one....
View
Full Document
 Fall '08
 Linderoth
 Operations Research, Graph Theory, Data Structures, k−vertex coloring, state space Methods

Click to edit the document details