A theoretical and computational study of green vehicle routing problems

DOI10.1007/s10878-023-01043-4MaRDI QIDQ6173935

Matheus Diógenes Andrade, Fábio Luiz Usberti

Publication date: 13 July 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationmathematical programmingmixed integer linear programmingvehicle routing problemgreen logistics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A new mathematical programming model for the green vehicle routing problem
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A path-based solution approach for the green vehicle routing problem
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• Instance generation framework for green vehicle routing
• Vehicle Routing
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A new approach to the maximum-flow problem
• Multi-Terminal Network Flows
• Depth-First Search and Linear Graph Algorithms
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

This page was built for publication: A theoretical and computational study of green vehicle routing problems