Showing 1 - 10 of 13
Persistent link: https://www.econbiz.de/10011948222
In this paper, we show both theoretically and empirically that the size of over-the-counter (OTC) markets can be reduced without affecting individual net positions. First, we find that the networked nature of these markets generates an excess of notional obligations between the aggregate gross...
Persistent link: https://www.econbiz.de/10011976943
Persistent link: https://www.econbiz.de/10000849735
Persistent link: https://www.econbiz.de/10000602368
optimality, a branch-and-cut algorithm has been developed and implemented. Extensive numerical experiments have been conducted in … order to evaluate the algorithm and to gain insights into the problem structure. The corresponding results show that the … algorithm is able to solve instances with up to 50 locations to optimality and that it reduces the computing time by 87 …
Persistent link: https://www.econbiz.de/10011618809
a delivery section and a pickup section and (ii) loading at the long side. A hybrid algorithm is proposed for the 3L …
Persistent link: https://www.econbiz.de/10011641365
iterated local search algorithm is designed for the simultaneous solution of the subproblems. By means of extensive numerical …
Persistent link: https://www.econbiz.de/10011641475
We extend the classical Pickup and Delivery Problem (PDP) to an integrated routing and two-dimensional loading problem, called PDP with two-dimensional loading constraints (2L-PDP). A set of routes of minimum total length has to be determined such that each request is transported from a loading...
Persistent link: https://www.econbiz.de/10011704776
the literature for the one-dimensional VRPMB to examine the performance of the routing algorithm and with newly generated …
Persistent link: https://www.econbiz.de/10011704777
Persistent link: https://www.econbiz.de/10014335316