Edward C. Sewell
YOU?
Author Swipe
View article: An Improved Meet in the Middle Algorithm for Graphs with Unit Costs
An Improved Meet in the Middle Algorithm for Graphs with Unit Costs Open
This paper proves several new properties of the Meet in the Middle (MMe) bidirectional heuristic search algorithm when applied to graphs with unit edge costs. Primarily, it is shown that the length of the first path discovered by MMe never…
View article: Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams Open
Branch-and-price algorithms combine a branch-and-bound search with an exponentially sized LP formulation that must be solved via column generation. Unfortunately, the standard branching rules used in branch and bound for integer programmin…