Similar Search Results

A branch-and-bound algorithm for the close-enough traveling salesman problem

Coutinho, Walton Pereira; Nascimento, Roberto Quirino do; … - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 752-765

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

A mathematical location-routing model of repair centres and ammunition depots in order to support soldiers in civil wars

Khalili-Damghani, Kaveh; Naderi, Hossein - In: International journal of management and decision making … 13 (2014) 4, pp. 422-450

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

Implicit enumeration strategies for the hypervolume subset selection problem

Gomes, Ricardo J.; Guerreiro, Andreia P.; Kuhn, Tobias; … - In: Computers & operations research : and their … 100 (2018), pp. 244-253

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

An exact method to generate all nondominated spanning trees

Boumesbah, Asma; Chergui, Mohamed El-Amine - In: RAIRO / Operations research 50 (2016) 4/5, pp. 857-867

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

A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization

Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180

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

A Branch & Cut algorithm for the prize-collecting capacitated location routing problem

Negrotto, Daniel; Loiseau, Irene - In: Top : an official journal of the Spanish Society of … 29 (2021) 1, pp. 34-57

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

Solving the Traveling Salesman Problem with release dates via branch and cut

Montero, Agustín; Méndez-Díaz, Isabel; … - In: EURO journal on transportation and logistics 12 (2023), pp. 1-12

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...

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

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Caselli, Giulia; Delorme, Maxence; Iori, Manuel; Magni, … - In: Computers & operations research : an international journal 163 (2024), pp. 1-15

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