The Journal of the Operational Research Society, Vol. 58, No. 12 (Dec., 2007), pp. 1642-1651 (10 pages) In open vehicle routing problems, the vehicles are not required to return to the depot after ...
We give a branch-and-cut algorithm for solving linear programs (LPs) with continuous separable piecewise-linear cost functions (PLFs). Models for PLFs use continuous variables in special-ordered sets ...
Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling. The fundamental task is to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback