Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs

A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector

(2023) Bilal Messaoudi et al.   INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

Sustainable humanitarian operations: An integrated perspective

(2022) Charles J. Corbett et al.   PRODUCTION AND OPERATIONS MANAGEMENT

The Capacitated Minimum Spanning Tree Problem with Arc Time Windows

(2021) Manolis N. Kritikos et al.   EXPERT SYSTEMS WITH APPLICATIONS

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

(2020) Adam N. Letchford et al.   OPERATIONS RESEARCH LETTERS

Arc routing problems: A review of the past, present, and future

(2020) Ángel Corberán et al.   NETWORKS

More efficient formulations and valid inequalities for the Green Vehicle Routing Problem

(2019) M. Bruglieri et al.   TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES

Two heuristics for the capacitated minimum spanning tree problem with time windows

(2018) Manolis N. Kritikos et al.   JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

Cold chain distribution: How to deal with node and arc time windows?

(2018) Yi Zhang et al.   ANNALS OF OPERATIONS RESEARCH

A greedy heuristic for the capacitated minimum spanning tree problem

(2017) M. Kritikos et al.   JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

(2015) Efrain Ruiz et al.   COMPUTERS & OPERATIONS RESEARCH

Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach

(2013) Cihan Çetinkaya et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Military supply chains and closed-loop systems: resource allocation and incentives in supply sourcing and supply chain design

(2013) Allen Wilhite et al.   INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH