Similar Search Results

Online algorithms for the multi-vehicle inventory-routing problem with real-time demands

Bertazzi, Luca; Chagas, Guilherme O.; Coelho, Leandro C.; … - 2023

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

A branch-and-cut and a parallel algorithm for packing two-dimensional rectangles in a circular container

Silva, Allyson; Coelho, Leandro C.; Darvish, Maryam; … - 2021

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

A three-front parallel branch-and-cut algorithm for production and inventory routing problems

Schenekemberg, Cleder M.; Guimarães, Thiago A.; … - 2022

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

A novel dynamic programming heuristic for the quadratic knapsack problem

Fennich, M. Eliass; Fomeni, Franklin Djeumou; Coelho, … - 2023

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

A three-front parallel branch-and-cut algorithm for production and inventory routing problems

Schenekemberg, Cleder Marcos; Guimarães, Thiago André; … - In: Transportation science 58 (2024) 4, pp. 687-707

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

A novel dynamic programming heuristic for the quadratic knapsack problem

Fennich, M. Eliass; Fomeni, Franklin Djeumou; Coelho, … - In: European journal of operational research : EJOR 319 (2024) 1, pp. 102-120

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

Two-phase branch-and-cut for the mixed capacitated general routing problem

Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; … - In: European journal of operational research : EJOR 243 (2015) 1, pp. 17-29

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

The periodic rural postman problem with irregular services on mixed graphs

Benavent, Enrique; Corberán, Ángel; Laganà, Demetrio; … - In: European journal of operational research : EJOR 276 (2019) 3, pp. 826-839

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

Two-phase branch-and-cut for the mixed capacitated general routing problem

Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; … - In: European Journal of Operational Research 243 (2015) 1, pp. 17-29

The Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the...

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

A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem

Coelho, Leandro C.; Laporte, Gilbert - In: International journal of production research 51 (2013) 23/24, pp. 7156-7169

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