This paper describes an exact algorithm for the fixed charge transportation problem based on a new integer programming formulation that involves two sets of variables representing flow patterns from ...

Finite State Automata (FSA): A computational model used for recognising patterns through states and transitions, often applied in the design of efficient matching algorithms.