Narrow search
Showing 1 - 10 of 1,261
Cover Image
An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns
Mingozzi, Aristide; Roberti, Roberto - In: Transportation science : a journal of the Institute for … 52 (2018) 2, pp. 229-238
Persistent link: https://www.econbiz.de/10011852809
Cover Image
A matheuristic for the two-stage fixed-charge transportation problem
Calvete, Herminia I.; Galé, Carmen; Iranzo, José A.; … - In: Computers & operations research : and their … 95 (2018), pp. 113-122
Persistent link: https://www.econbiz.de/10011866586
Cover Image
Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies
Bertazzi, Luca; Speranza, Maria Grazia; Ukovich, Walter - In: Management Science 46 (2000) 7, pp. 973-988
frequencies is available, in such a way that the sum of the transportation and inventory costs is minimized. This problem, which … is known to be NP-hard, has applications in transportation planning and in location analysis. In this paper we derive …
Persistent link: https://www.econbiz.de/10009204346
Cover Image
LOWER BOUND APPROXIMATION TO BASKET OPTION VALUES FOR LOCAL VOLATILITY JUMP-DIFFUSION MODELS
XU, GUOPING; ZHENG, HARRY - In: International Journal of Theoretical and Applied … 17 (2014) 01, pp. 1450007-1
In this paper, we derive an easily computed approximation to European basket call prices for a local volatility jump-diffusion model. We apply the asymptotic expansion method to find the approximate value of the lower bound of European basket call prices. If the local volatility function is time...
Persistent link: https://www.econbiz.de/10010883224
Cover Image
A fast and simple branching algorithm for solving small scale fixed-charge transportation problem
Kowalski, Krzysztof; Lev, Benjamin; Shen, Wenjing; Tu, Yan - In: Operations Research Perspectives 1 (2014) 1, pp. 1-5
-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into …
Persistent link: https://www.econbiz.de/10011117661
Cover Image
Fixed charge multicommodity network design using p-partition facets
Agarwal, Y. K.; Aneja, Yash P. - In: European journal of operational research : EJOR 258 (2017) 1, pp. 124-135
Persistent link: https://www.econbiz.de/10011641472
Cover Image
An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots
Calvete, Herminia I.; Galé, Carmen; Iranzo, José A. - In: OR spectrum : quantitative approaches in management 38 (2016) 1, pp. 189-206
Persistent link: https://www.econbiz.de/10011697480
Cover Image
Greedy iterative genetic algorithm for the volume-based cross dock transportation problem associated with fixed charge
Joseph, Solomon; Sridharan, R. - In: International journal of logistics systems and … 37 (2020) 4, pp. 488-539
Persistent link: https://www.econbiz.de/10012513633
Cover Image
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu; Zhang, Zizhen; Lim, Andrew; Liang, Xiaocong - In: European journal of operational research : EJOR 250 (2016) 2, pp. 412-426
Persistent link: https://www.econbiz.de/10011441587
Cover Image
The two-machine flowshop total completion time problem : branch-and-bound algorithms based on network-flow formulation
Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji - In: European journal of operational research : EJOR 252 (2016) 3, pp. 750-760
Persistent link: https://www.econbiz.de/10011472309