Similar Search Results

Incremental network design with shortest paths

Baxter, Matthew; Elgindy, Tarek; Ernst, Andreas T.; … - In: European Journal of Operational Research 238 (2014) 3, pp. 675-684

We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest...

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

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain

Boland, Natashia; Kalinowski, Thomas; Waterer, Hamish; … - In: Journal of scheduling 16 (2013) 6, pp. 649-659

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

Incremental network design with shortest paths

Baxter, Matthew; Elgindy, Tarek; Ernst, Andreas T.; … - In: European journal of operational research : EJOR 238 (2014) 3, pp. 675-684

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

Incremental network design with maximum flows

Kalinowski, Thomas; Matsypura, Dmytro; Savelsbergh, … - In: European journal of operational research : EJOR 242 (2015) 1, pp. 51-62

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

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time : bounds and solution strategies

Boland, Natashia; Kalinowski, Thomas; Kaur, Simranjit - In: Computers & operations research : and their … 64 (2015), pp. 113-129

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

Scheduling of maintenance windows in a mining supply chain rail network

Kalinowski, Thomas; Matthews, Jason; Waterer, Hamish - In: Computers & operations research : and their … 115 (2020), pp. 1-15

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