Similar Search Results

A reclaimer scheduling problem arising in coal stockyard management

Angelelli, Enrico; Kalinowski, Thomas; Kapoor, Reena; … - In: Journal of scheduling 19 (2016) 5, pp. 563-582

Persistent link: https://www.econbiz.de/10011593866

The traveling purchaser problem with time-dependent quantities

Angelelli, Enrico; Gendreau, Michel; Mansini, Renata; … - In: Computers & operations research : and their … 82 (2017), pp. 15-26

Persistent link: https://www.econbiz.de/10011674381

American and European portfolio selection strategies : the Markovian approach

Angelelli, Enrico; Ortobelli, Sergio - In: Financial hedging, (pp. 119-152). 2009

Persistent link: https://www.econbiz.de/10008799130

Minimizing the total travel time with limited unfairness in traffic networks

Angelelli, Enrico; Morandi, V.; Speranza, Maria Grazia - In: Computers & operations research : and their … 123 (2020), pp. 1-15

Persistent link: https://www.econbiz.de/10012286271

A matheuristic for the air transportation freight forwarder service problem

Angelelli, Enrico; Archetti, Claudia; Peirano, Lorenzo - In: Computers & operations research : and their … 123 (2020), pp. 1-13

Persistent link: https://www.econbiz.de/10012286293

A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints

Angelelli, Enrico; Morandi, V.; Speranza, Maria Grazia - In: Computers & operations research : and their … 110 (2019), pp. 88-100

Persistent link: https://www.econbiz.de/10012065085

System optimal routing of traffic flows with user constraints using linear programming

Angelelli, Enrico; Morandi, V.; Savelsbergh, Martin W. P.; … - In: European journal of operational research : EJOR 293 (2021) 3, pp. 863-879

Persistent link: https://www.econbiz.de/10012533781

Multi‑day fair collaboration in demand‑responsive transportation

Angelelli, Enrico; Morandi, V.; Speranza, Maria Grazia - In: Central European journal of operations research 32 (2024) 2, pp. 209-239

Persistent link: https://www.econbiz.de/10014537308

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

Filippi, Carlo - In: Operations research letters 38 (2010) 4, pp. 312-317

Persistent link: https://www.econbiz.de/10003984254

Branch-and-cut algorithms for the split delivery vehicle routing problem

Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia - In: European Journal of Operational Research 238 (2014) 3, pp. 685-698

In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed...

Persistent link: https://www.econbiz.de/10010785322