Pup Matching: Model Formulations and Solution Approaches
We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs able to tow one or two pups simultaneously, as an NP-complete version of the Network Loading Problem (NLP). We examine a branch and bound solution approach tailored to the NLP formulation through...
Main Authors: | Bossert, J.M., Magnanti, Thomas L. |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/4007 |
Similar Items
-
Pup Matching: Model Formulations and Solution Approaches
by: Bossert, John M., et al.
Published: (2004) -
Revisiting a Cutting-Plane Method for Perfect Matchings
by: Chen, Amber Q., et al.
Published: (2020-12-01) -
PREDICTION OF CUTTING LOAD OF DRUM SHEARER BASED ON DEEP BELIEF NETWORK
by: MAO Jun, et al.
Published: (2020-01-01) -
A Dual-Based Algorithm for Multi-Level Network Design
by: Balakrishnan, Anantaram, et al.
Published: (2004) -
The Convex Hull of Two Core Capacitated Network Design Problems
by: Magnanti, Thomas L., et al.
Published: (2004)