Pup Matching: Model Formulations and Solution Approaches

We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs that are able to tow one or two of the pups simultaneously, as an AfP-complete version of the Network Loading Problem (NLP). We examine a branch and bound solution approach tailored to the NLP form...

全面介紹

書目詳細資料
Main Authors: Bossert, John M., Magnanti, Thomas L.
格式: Working Paper
語言:en_US
出版: Massachusetts Institute of Technology, Operations Research Center 2004
在線閱讀:http://hdl.handle.net/1721.1/5076

相似書籍