Similar Search Results

Exact algorithms for the traveling salesman problem with draft limits

Battarra, Maria; Pessoa, Artur Alves; Subramanian, Anand; … - In: European Journal of Operational Research 235 (2014) 1, pp. 115-128

This paper deals with the Traveling Salesman Problem (TSP) with Draft Limits (TSPDL), which is a variant of the well-known TSP in the context of maritime transportation. In this recently proposed problem, draft limits are imposed due to restrictions on the port infrastructures. Exact algorithms...

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

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times

Silva, Yuri Laio T. V.; Subramanian, Anand; Pessoa, Artur - In: Computers & operations research : and their … 90 (2018), pp. 142-160

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

Exact algorithms for the traveling salesman problem with draft limits

Battarra, Maria; Pessoa, Artur; Subramanian, Anand; … - In: European journal of operational research : EJOR 235 (2014) 1, pp. 115-128

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

Conference scheduling : a clustering-based approach

Bulhões, Teobaldo; Correia, Rubens; Subramanian, Anand - In: European journal of operational research : EJOR 297 (2022) 1, pp. 15-26

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

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Praxedes, Rafael; Bulhões, Teobaldo; Subramanian, Anand; … - In: Computers & operations research : an international journal 162 (2024), pp. 1-12

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

Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates

Morais, Rafael; Bulhões, Teobaldo; Subramanian, Anand - In: European journal of operational research : EJOR 315 (2024) 2, pp. 442-453

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