We propose a new approach to formulating the Scheduled Service Network Design Problem (SSNDP) that involves modeling with enumerated consolidations of shipments routed on the physical network. This is in contrast to the classical approach of capturing the synchronization of vehicles and...

Unconstrained Binary Polynomial Programs (UBPs) are a class of optimization problems relevant in a broad array of fields. In this paper, we examine an example from communication engineering, namely low autocorrelation binary sequences and propose a new dynamic programming approach that is...