On the public citation graph
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
0 signed · 491 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-17885-1_101452openalex-snapshot
Vehicle Routing Problem
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1057/jors.1967.44openalex-snapshot
Bases for Vehicle Fleet Scheduling
inferredcites →https://doi.org/10.1057/jors.1976.202openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.1145/321043.321046openalex-snapshot
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/opre.12.2.300openalex-snapshot
On an Integer Program for a Delivery Problem
inferredcites →https://doi.org/10.1287/opre.12.4.568openalex-snapshot
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.22.2.340openalex-snapshot
A Heuristic Algorithm for the Vehicle-Dispatch Problem
inferredcites →https://doi.org/10.21236/ada013639openalex-snapshot
Vehicle Routing Problems: Formulations and Heuristic Solution Techniques
inferredcites →https://doi.org/10.2307/2986859openalex-snapshot
Distribution Management: Mathematical Modelling and Practical Analysis.
inferredcites →https://doi.org/10.2307/3009122openalex-snapshot
Graph Theory: An Algorithmic Approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4096498openalex-extracted
On a Pickup to Delivery Drone Routing Problem: Models and Algorithms
inferred← citeshttps://doi.org/10.5281/zenodo.1078405openalex-extracted
Mobile Medical Operation Route Planning
inferred← citeshttps://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-eopenalex-snapshot
A branch and cut method for the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0949openalex-snapshot
Exact Solution of the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1002/9780470612491.ch9openalex-snapshot
An Overview of Applications
inferred← citeshttps://doi.org/10.1002/hpm.70112openalex-snapshot
A Multi‐Objective Periodic Vehicle Routing Model for Sustainable Healthcare Waste Collection
inferred← citeshttps://doi.org/10.1002/net.20330openalex-snapshot
A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.20331openalex-snapshot
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
inferred← citeshttps://doi.org/10.1002/net.21511openalex-snapshot
A survey of resource constrained shortest path problems: Exact solution approaches
inferred← citeshttps://doi.org/10.1002/net.21942openalex-snapshot
On the road to better routes: Five decades of published research on the vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.3230110204openalex-snapshot
Classification in vehicle routing and scheduling
inferred← citeshttps://doi.org/10.1002/net.3230110207openalex-snapshot
State‐space relaxation procedures for the computation of bounds to routing problems
inferred← citeshttps://doi.org/10.1002/net.3230140113openalex-snapshot
Two exact algorithms for the distance‐constrained vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.3230160104openalex-snapshot
An exact algorithm for the asymmetrical capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.3230190402openalex-snapshot
An algorithm for the resource constrained shortest path problem
inferred← citeshttps://doi.org/10.1002/net.3230190702openalex-snapshot
A set‐partitioning‐based exact algorithm for the vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.3230220706openalex-snapshot
The Capacitated Arc Routing Problem: Lower bounds
inferred← citeshttps://doi.org/10.1002/spe.2838openalex-snapshot
Applying artificial bee colony algorithm to the multidepot vehicle routing problem
inferred← citeshttps://doi.org/10.1007/0-306-48058-1_12openalex-snapshot
Street Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_3openalex-snapshot
Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_6openalex-snapshot
Modeling and Optimization of Vehicle Routing and Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_6openalex-snapshot
Branch, Cut, and Price: Sequential and Parallel
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_23openalex-snapshot
Three Parallel Algorithms for Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_1openalex-snapshot
Routing a Heterogeneous Fleet of Vehicles
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_14openalex-snapshot
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-349-12362-9_21openalex-snapshot
Expert Systems for Vehicle Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_63openalex-snapshot
Combinatorial Optimization in Transportation and Logistics Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2321-7_43openalex-snapshot
Parallel CUDA Architecture for Solving de VRP with ACO
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-9149-1_19openalex-snapshot
Solving the VRP Using a Column-Generation Approach
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_7openalex-snapshot
A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-5203-1_12openalex-snapshot
Street Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_1openalex-snapshot
Exact Solution of the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-02131-3_48openalex-snapshot
Solving Location Based Inventory Routing Problem in E-Commerce Using Ant Colony Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-32475-9_13openalex-snapshot
CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet
inferred← citeshttps://doi.org/10.1007/978-3-030-34706-2_7openalex-snapshot
Tabu Search Algorithm for Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-030-41196-1_15openalex-snapshot
Computational Intelligence and Combinatorial Optimization Problems in Transportation Science
inferred← citeshttps://doi.org/10.1007/978-3-030-53552-0_21openalex-snapshot
Automated Tuning of a Column Generation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-56534-3_9openalex-snapshot
Heuristic Optimization for Multi-Depot Vehicle Routing Problem in ATM Network Model
inferred← citeshttps://doi.org/10.1007/978-3-030-70740-8_12openalex-snapshot
The GRASP Metaheuristic for the Electric Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-81854-8_4openalex-snapshot
Logistics Route Planning in Agent-Based Simulation and Its Optimization Represented in Higher-Order Markov-Chain Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-87626-5_1openalex-snapshot
RP-DQN: An Application of Q-Learning to Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-22311-2_18openalex-snapshot
A Method for Planning the Supply of Petroleum Products to Filling Stations Based on Multi-agent Resource Conversion Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-24457-5_27openalex-snapshot
A Constraint Programming Model for the Open Vehicle Routing Problem with Heterogeneous Vehicle Fleet
inferred← citeshttps://doi.org/10.1007/978-3-031-32412-3_2openalex-snapshot
Two-Phase Algorithm for Solving Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-031-33271-5_3openalex-snapshot
Column Elimination for Capacitated Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-03101-3_19openalex-snapshot
Enhancing EVRP Benchmark Instances with Energy Estimates
inferred← citeshttps://doi.org/10.1007/978-3-319-05035-5_2openalex-snapshot
Survey of Methodologies for TSP and VRP
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_33openalex-snapshot
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
inferred← citeshttps://doi.org/10.1007/978-3-319-16000-9_3openalex-snapshot
Constrained Probability Collectives: A Heuristic Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-18167-7_11openalex-snapshot
A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict
inferred← citeshttps://doi.org/10.1007/978-3-319-19369-4_60openalex-snapshot
UCT-Based Approach to Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-24418-1_9openalex-snapshot
Efficient Inventorying and Distribution of Blood Product During Disasters
inferred← citeshttps://doi.org/10.1007/978-3-319-27340-2_83openalex-snapshot
An Almost Time Optimal Route Planning Method for Complex Manufacturing Topologies
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_8openalex-snapshot
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-46810-5_14openalex-snapshot
Recharge Scheduling with Multiple Mobile Chargers
inferred← citeshttps://doi.org/10.1007/978-3-319-60042-0_6openalex-snapshot
A New System for the Dynamic Shortest Route Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_1openalex-snapshot
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_62openalex-snapshot
Column Generation Algorithms for the Capacitated m-Ring-Star Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_12openalex-snapshot
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-85984-0_31openalex-snapshot
Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00487-2_19openalex-snapshot
The Undirected Rural Postman Problem Solved by the MAX-MIN Ant System
inferred← citeshttps://doi.org/10.1007/978-3-642-02481-8_74openalex-snapshot
Rank-Based Ant System to Solve the Undirected Rural Postman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_27openalex-snapshot
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-23860-4_94openalex-snapshot
Optimum Restoration of the Shared Pallets Distribution Among Factories and Warehouses
inferred← citeshttps://doi.org/10.1007/978-3-662-43871-8_236openalex-snapshot
A Hybrid Optimization Algorithm for Travelling Salesman Problem Based on Geographical Information System for Logistics Distribution
inferred← citeshttps://doi.org/10.1007/978-3-662-45049-9_56openalex-snapshot
An Improved Golden Ball Algorithm for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-981-16-3945-6_77openalex-snapshot
Comparison of Machine Learning Algorithms for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-981-96-8165-5_221-1openalex-snapshot
Foundations of Linear Programming and Its Applications in Optimization
inferred← citeshttps://doi.org/10.1007/978-981-99-0047-3_53openalex-snapshot
Comparison of Attention Mechanisms in Machine Learning Models for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/bf01720015openalex-snapshot
A branch and bound algorithm for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/bf02023004openalex-snapshot
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
inferred← citeshttps://doi.org/10.1007/bf02061657openalex-snapshot
Topological design of telecommunication networks-local access design methods
inferred← citeshttps://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferred← citeshttps://doi.org/10.1007/bf02098280openalex-snapshot
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations
inferred← citeshttps://doi.org/10.1007/bf02941184openalex-snapshot
Annotated bibliography in vehicle routing
inferred← citeshttps://doi.org/10.1007/s00170-008-1648-5openalex-snapshot
A new mathematical modeling and a genetic algorithm search for milk run problem (an auto industry supply chain case study)
inferred← citeshttps://doi.org/10.1007/s00500-015-1970-4openalex-snapshot
Efficient route planning for an unmanned air vehicle deployed on a moving carrier
inferred← citeshttps://doi.org/10.1007/s10107-003-0481-8openalex-snapshot
A new branch-and-cut algorithm for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0644-xopenalex-snapshot
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/s10107-006-0043-yopenalex-snapshot
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation
inferred← citeshttps://doi.org/10.1007/s10107-007-0178-5openalex-snapshot
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
inferred← citeshttps://doi.org/10.1007/s10107-008-0218-9openalex-snapshot
A unified exact method for solving different classes of vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10107-011-0497-4openalex-snapshot
Improved lower bounds and exact algorithm for the capacitated arc routing problem
inferred← citeshttps://doi.org/10.1007/s10107-017-1151-6openalex-snapshot
Exact algorithms for the chance-constrained vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10163-026-02742-wopenalex-snapshot
On designing an efficient decision support system for healthcare waste collection
inferred← citeshttps://doi.org/10.1007/s10287-009-0118-3openalex-snapshot
An exact solution framework for a broad class of vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10288-007-0063-3openalex-snapshot
Recent advances in vehicle routing exact algorithms
inferred← citeshttps://doi.org/10.1007/s10288-012-0197-9openalex-snapshot
Models and methods for the constrained shortest path problem and its variants
inferred← citeshttps://doi.org/10.1007/s10288-012-0206-zopenalex-snapshot
Exact algorithms for different classes of vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10479-009-0650-0openalex-snapshot
Exact algorithms for routing problems under vehicle capacity constraints
inferred← citeshttps://doi.org/10.1007/s10479-012-1162-xopenalex-snapshot
A computational study of solution approaches for the resource constrained elementary shortest path problem
inferred← citeshttps://doi.org/10.1007/s10479-014-1732-1openalex-snapshot
A compact transformation of arc routing problems into node routing problems
inferred← citeshttps://doi.org/10.1007/s10589-005-3070-3openalex-snapshot
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/s10589-019-00154-1openalex-snapshot
Empirical study of exact algorithms for the multi-objective spanning tree
inferred← citeshttps://doi.org/10.1007/s10696-015-9222-6openalex-snapshot
The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers
inferred← citeshttps://doi.org/10.1007/s10729-026-09779-1openalex-snapshot
Data-driven smart freight fleet management amid epidemic disruptions: A framework and case study
inferred← citeshttps://doi.org/10.1007/s10732-009-9112-8openalex-snapshot
A metaheuristic for stochastic service network design
inferred← citeshttps://doi.org/10.1007/s10845-009-0311-9openalex-snapshot
An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model
inferred← citeshttps://doi.org/10.1007/s10878-017-0159-4openalex-snapshot
ILP formulation of the degree-constrained minimum spanning hierarchy problem
inferred← citeshttps://doi.org/10.1007/s10878-025-01344-wopenalex-snapshot
Moving Horizon Capacitated Arc Routing Problem
inferred← citeshttps://doi.org/10.1007/s11047-016-9550-9openalex-snapshot
Dynamic vehicle routing with time windows in theory and practice
inferred← citeshttps://doi.org/10.1007/s11081-026-10113-5openalex-snapshot
The integrated vehicle and pollster routing problem
inferred← citeshttps://doi.org/10.1007/s11277-020-07535-4openalex-snapshot
Automotive Power Window Communication with DTC Algorithm and Hardware-in-the Loop Testing
inferred← citeshttps://doi.org/10.1007/s11590-012-0568-3openalex-snapshot
Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/s11590-012-0570-9openalex-snapshot
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
inferred← citeshttps://doi.org/10.1007/s11590-012-0571-8openalex-snapshot
A min–max vehicle routing problem with split delivery and heterogeneous demand
inferred← citeshttps://doi.org/10.1007/s11590-016-1078-5openalex-snapshot
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
inferred← citeshttps://doi.org/10.1007/s12351-017-0299-4openalex-snapshot
Mixed integer formulations for the multiple minimum latency problem
inferred← citeshttps://doi.org/10.1007/s12351-017-0314-9openalex-snapshot
Dynamic routing with real-time traffic information
inferred← citeshttps://doi.org/10.1007/s12351-022-00701-5openalex-snapshot
Vehicle routing problem under safe separation distance for multiple unmanned aerial vehicle operation
inferred← citeshttps://doi.org/10.1007/s12532-016-0108-8openalex-snapshot
Improved branch-cut-and-price for capacitated vehicle routing
inferred← citeshttps://doi.org/10.1007/s13177-026-00650-9openalex-snapshot
Shipper-Driven Consolidation Mechanisms for Freight Transport
inferred← citeshttps://doi.org/10.1007/s13676-013-0020-6openalex-snapshot
Vehicle routing: historical perspective and recent contributions
inferred← citeshttps://doi.org/10.1007/s42979-025-03721-yopenalex-snapshot
Joint Localization and Data-Based Path Planning for UAV-Assisted IoT Networks: A Heuristic Approach
inferred← citeshttps://doi.org/10.1007/s43069-020-00044-xopenalex-snapshot
Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem
inferred← citeshttps://doi.org/10.1007/s43069-020-00052-xopenalex-snapshot
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90081-8openalex-snapshot
Microcomputer-based algorithms for large scale shortest path problems
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90082-xopenalex-snapshot
A new variant of the partitioning shortest path algorithm
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90012-5openalex-snapshot
Heuristics for unequal weight delivery problems with a fixed error guarantee
inferred← citeshttps://doi.org/10.1016/0191-2607(85)90039-1openalex-snapshot
Future directions in logistics research
inferred← citeshttps://doi.org/10.1016/0191-2607(86)90097-xopenalex-snapshot
Research perspectives in vehicle routing and scheduling
inferred← citeshttps://doi.org/10.1016/0270-0255(87)90004-2openalex-snapshot
A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
inferred← citeshttps://doi.org/10.1016/0305-0483(88)90024-2openalex-snapshot
An analysis of the distribution system of a brewery
inferred← citeshttps://doi.org/10.1016/0305-0483(88)90031-xopenalex-snapshot
Expanding the scope of linear programming solutions for vehicle scheduling problems
inferred← citeshttps://doi.org/10.1016/0305-0483(88)90047-3openalex-snapshot
An effective method of balancing the workload amongst salesmen
inferred← citeshttps://doi.org/10.1016/0305-0548(81)90035-6openalex-snapshot
Current and future research directions in network optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90026-6openalex-snapshot
Computational experiments with algorithms for a class of routing problems
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90029-9openalex-snapshot
Topological design of ring networks
inferred← citeshttps://doi.org/10.1016/0377-2217(83)90160-1openalex-snapshot
Solving symmetric vehicle routing problems asymmetrically
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90050-xopenalex-snapshot
A Lagrangean relaxation heuristic for vehicle routing
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90089-xopenalex-snapshot
Vehicle routing via column generation
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90057-xopenalex-snapshot
The vehicle routing problem with backhauls
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90319-qopenalex-snapshot
The pickup and delivery problem with time windows
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90192-copenalex-snapshot
The vehicle routing problem: An overview of exact and approximate algorithms
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0277-5openalex-snapshot
An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00025-8openalex-snapshot
A result on projection for the vehicle routing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00332-7openalex-snapshot
A new subtour elimination constraint for the vehicle routing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90063-9openalex-snapshot
A TSSP + 1 decomposition strategy for the vehicle routing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00185-9openalex-snapshot
A genetic algorithm for service level based vehicle scheduling
inferred← citeshttps://doi.org/10.1016/0377-2217(96)00223-8openalex-snapshot
A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2023.103555openalex-snapshot
Scatter search for capacitated minimum spanning tree
inferred← citeshttps://doi.org/10.1016/j.apm.2017.02.042openalex-snapshot
A new efficient approach for solving the capacitated Vehicle Routing Problem using the Gravitational Emulation Local Search Algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.09.006openalex-snapshot
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.12.012openalex-snapshot
A hybrid swarm algorithm based on ABC and AIS for 2L-HFCVRP
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110913openalex-snapshot
A co-evolutionary genetic algorithm with knowledge transfer for multi-objective capacitated vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108632openalex-snapshot
On a Pickup to Delivery Drone Routing Problem: Models and algorithms
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111422openalex-snapshot
An iterated local search based approach for a real rich vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cie.2026.112311openalex-snapshot
Time-dependent low-carbon vehicle routing problem for urban logistics: integrating traffic congestion, road gradient and vehicle load
inferred← citeshttps://doi.org/10.1016/j.cor.2004.11.020openalex-snapshot
Solving capacitated arc routing problems using a transformation to the CVRP
inferred← citeshttps://doi.org/10.1016/j.cor.2005.08.002openalex-snapshot
A column generation approach to the heterogeneous fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2006.11.006openalex-snapshot
Formulations and exact algorithms for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2010.10.010openalex-snapshot
Heuristic and exact algorithms for a min–max selective vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.07.004openalex-snapshot
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.cor.2012.08.011openalex-snapshot
A column generation approach for a school bus routing problem with resource constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2012.11.021openalex-snapshot
The Pickup and Delivery Problem with Cross-Docking
inferred← citeshttps://doi.org/10.1016/j.cor.2014.05.014openalex-snapshot
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations
inferred← citeshttps://doi.org/10.1016/j.cor.2015.04.016openalex-snapshot
Exact algorithms for the double vehicle routing problem with multiple stacks
inferred← citeshttps://doi.org/10.1016/j.cor.2015.04.023openalex-snapshot
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2016.07.014openalex-snapshot
The pickup and delivery problem with time windows and handling operations
inferred← citeshttps://doi.org/10.1016/j.cor.2017.02.022openalex-snapshot
An open source Spreadsheet Solver for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1016/j.cor.2018.01.016openalex-snapshot
A branch-and-price algorithm for the Minimum Latency Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.11.005openalex-snapshot
The electric two-echelon vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105772openalex-snapshot
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106189openalex-snapshot
Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2020.08.014openalex-snapshot
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.06.001openalex-snapshot
A dual ascent procedure for the set partitioning problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.03.001openalex-snapshot
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.08.001openalex-snapshot
A branch-and-cut algorithm for the capacitated profitable tour problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100710openalex-snapshot
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.dss.2015.08.001openalex-snapshot
A decision support system tool for the transportation by barge of import containers: A case study
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.07.077openalex-snapshot
A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.09.052openalex-snapshot
Nodal aggregation of resource constraints in a shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.07.037openalex-snapshot
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.01.043openalex-snapshot
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.02.048openalex-snapshot
An exact algorithm for the precedence-constrained single-machine scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.08.032openalex-snapshot
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.10.018openalex-snapshot
The distance constrained multiple vehicle traveling purchaser problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.005openalex-snapshot
Efficient elementary and restricted non-elementary route pricing
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.07.025openalex-snapshot
Min–Max vs. Min–Sum Vehicle Routing: A worst-case analysis
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.09.050openalex-snapshot
Route relaxations on GPU for vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.12.017openalex-snapshot
The Traveling Purchaser Problem and its variants
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.03.027openalex-snapshot
Solving the Team Orienteering Arc Routing Problem with a column generation approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.03.033openalex-snapshot
The demand weighted vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.04.025openalex-snapshot
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.027openalex-snapshot
The vehicle routing problem with service level constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.04.009openalex-snapshot
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.04.010openalex-snapshot
Vehicle routing with probabilistic capacity constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.06.049openalex-snapshot
A branch-and-price algorithm for a vehicle routing with demand allocation problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.11.035openalex-snapshot
Adaptive Large Neighborhood Search on the Graphics Processing Unit
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.068openalex-snapshot
Industrial and tramp ship routing problems: Closing the gap for real-scale instances
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.043openalex-snapshot
Integrating driver behavior into last-mile delivery routing: Combining machine learning and optimization in a hybrid decision support framework
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.04.011openalex-snapshot
A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem
showing the first 200 of 474 · page through all 474
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.