Search Results - subject:"Dual ascent"

Boschetti, Marco A.; Letchford, Adam N.; Maniezzo, Vittorio - In: International transactions in operational research : a … 30 (2023) 6, pp. 2840-2866

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

Solution strategy for inventory constrained maritime routing and scheduling : multi-commodity bulk shipping

Hwang, Seung-June; Baek, Seung Hyun - In: European journal of international management : EJIM 24 (2024) 1, pp. 153-186

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

A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems

Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 402-420

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

The vehicle routing problem with transhipment facilities

Baldacci, Roberto; Ngueveu, Sandra Ulrich; Calvo, … - In: Transportation science : a journal of the Institute for … 51 (2017) 2, pp. 592-606

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

An algorithmic framework for the exact solution of tree-star problems

Leitner, Markus; Ljubić, Ivana; Salazar-González, … - In: European journal of operational research : EJOR 261 (2017) 1, pp. 54-66

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

A set covering based matheuristic for a real-world city logistic problem

Boschetti, Marco; Maniezzo, Vittorio - In: International transactions in operational research : … 22 (2015) 1, pp. 169-196

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

Models and algorithms for network reduction

Li, Gang; Balakrishnan, Anantaram - In: European journal of operational research : EJOR 249 (2016) 3, pp. 930-942

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

Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation

Rostami, Borzou; Malucelli, Federico - In: Computers & operations research : and their … 64 (2015), pp. 178-188

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

Lower and upper bounds for the spanning tree with minimum branch vertices

Carrabs, Francesco; Cerulli, Raffaele; Gaudioso, Manlio; … - In: Computational Optimization and Applications 56 (2013) 2, pp. 405-438

We study a variant of the spanning tree problem where we require that, for a given connected graph, the spanning tree to be found has the minimum number of branch vertices (that is vertices of the tree whose degree is greater than two). We provide four different formulations of the problem and...

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

An exact solution framework for a broad class of vehicle routing problems

Baldacci, Roberto; Bartolini, Enrico; Mingozzi, Aristide; … - In: Computational Management Science 7 (2010) 3, pp. 229-268

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