Similar Search Results

Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations

Dayama, Niraj Ramesh; Krishnamoorthy, Mohan; Ernst, Andreas - In: Computers & operations research : and their … 52 (2014), pp. 68-83

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

History-dependent scheduling : models and algorithms for scheduling with general precedence and sequence dependence

Dayama, Niraj Ramesh; Krishnamoorthy, Mohan; Ernst, Andreas - In: Computers & operations research : and their … 64 (2015), pp. 245-261

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

The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems

Mokhtar, Hamid; Krishnamoorthy, Mohan; Ernst, Andreas T. - In: Computers & operations research : and their … 104 (2019), pp. 375-393

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

An intermodal hub location problem for container distribution in Indonesia

Mokhtar, Hamid; Redi, A. A. N. Perwira; Krishnamoorthy, … - In: Computers & operations research : and their … 104 (2019), pp. 415-432

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

Heuristic algorithms for the single allocation p-hub center problem with routing considerations

Kartal, Zühal; Krishnamoorthy, Mohan; Ernst, Andreas T. - In: OR spectrum : quantitative approaches in management 41 (2019) 1, pp. 99-145

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

New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports

Dayama, Niraj Ramesh; Ernst, Andreas; Krishnamoorthy, Mohan - In: EURO journal on transportation and logistics 6 (2017) 4, pp. 307-348

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

A new two-stage heuristic for the recreational vehicle scheduling problem

Kulkarni, Sarang; Patil, Rahul; Krishnamoorthy, Mohan; … - In: Computers & operations research : and their … 91 (2018), pp. 59-78

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

Uncapacitated single and multiple allocation p-hub center problems

Ernst, Andreas T.; Hamacher, Horst W.; Jiang, Houyuan; … - In: Computers & operations research : and their … 36 (2009) 7, pp. 2230-2241

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

Reformulations and Computational Results for the Uncapacitated Single. Allocation Hub Covering Problem

Andreas T. Ernst; Jiang, Houyuan; Krishnamoorthy, Mohan; … - Judge Business School <Cambridge> - 2011

We study the single allocation hub covering problem, which is a special case of the general hub locationproblem. The hub covering problem is also an important extension to traditional network coveringproblems. Hubs are located at some nodes in the network and are used to facilitate –...

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

Exact approaches for static data segment allocation problem in an information network

Sen, Goutam; Krishnamoorthy, Mohan; Rangaraj, Narayan; … - In: Computers & operations research : and their … 62 (2015), pp. 282-295

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