On the public citation graph

A new branch-and-cut algorithm for the capacitated vehicle routing problem

https://doi.org/10.1007/s10107-003-0481-8
0 signed · 611 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0037(199603)27:2<97::aid-net1>3.0.co;2-8openalex-snapshot
An optimal algorithm for the mixed Chinese postman problem
inferredcites →https://doi.org/10.1002/net.3230110212openalex-snapshot
Formulation and structure of more complex/realistic routing and scheduling problems
inferredcites →https://doi.org/10.1002/net.3230190702openalex-snapshot
A set‐partitioning‐based exact algorithm for the vehicle routing problem
inferredcites →https://doi.org/10.1007/3-540-45750-x_12openalex-snapshot
GVR: A New Genetic Representation for the Vehicle Routing Problem
inferredcites →https://doi.org/10.1007/bf01580599openalex-snapshot
Polyhedral study of the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/bf01580861openalex-snapshot
Facet identification for the symmetric traveling salesman polytope
inferredcites →https://doi.org/10.1007/bf01582116openalex-snapshot
On the symmetric travelling salesman problem I: Inequalities
inferredcites →https://doi.org/10.1007/bf01582117openalex-snapshot
On the symmetric travelling salesman problem II: Lifting theorems and facets
inferredcites →https://doi.org/10.1007/bf01589353openalex-snapshot
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
inferredcites →https://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferredcites →https://doi.org/10.1007/bf02098280openalex-snapshot
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations
inferredcites →https://doi.org/10.1007/bf02288323openalex-snapshot
Algorithms and codes for the assignment problem
inferredcites →https://doi.org/10.1007/s10107-002-0323-0openalex-snapshot
On the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s10107-002-0336-8openalex-snapshot
Multistars, partial multistars and the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s10107-005-0644-xopenalex-snapshot
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
inferredcites →https://doi.org/10.1016/0167-6377(96)00007-7openalex-snapshot
Gomory cuts revisited
inferredcites →https://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferredcites →https://doi.org/10.1016/0377-2217(91)90337-uopenalex-snapshot
Polyhedral results for a vehicle routing problem
inferredcites →https://doi.org/10.1016/0377-2217(92)90192-copenalex-snapshot
The vehicle routing problem: An overview of exact and approximate algorithms
inferredcites →https://doi.org/10.1016/0377-2217(94)00025-8openalex-snapshot
A result on projection for the vehicle routing problem
inferredcites →https://doi.org/10.1016/j.cor.2005.09.012openalex-snapshot
A general heuristic for vehicle routing problems
inferredcites →https://doi.org/10.1016/s0166-218x(01)00351-1openalex-snapshot
Models, relaxations and exact approaches for the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1016/s0167-8191(03)00045-0openalex-snapshot
Parallel branch and cut for capacitated vehicle routing
inferredcites →https://doi.org/10.1016/s0377-2217(03)00035-3openalex-snapshot
Combination of geographical information system and efficient routing algorithms for real life distribution operations
inferredcites →https://doi.org/10.1016/s0377-2217(03)00238-8openalex-snapshot
A tabu search algorithm for the open vehicle routing problem
inferredcites →https://doi.org/10.1016/s0377-2217(97)00290-7openalex-snapshot
Separating capacity constraints in the CVRP using tabu search
inferredcites →https://doi.org/10.1057/jors.1969.75openalex-snapshot
An Algorithm for the Vehicle-dispatching Problem
inferredcites →https://doi.org/10.1057/palgrave.jors.2601817openalex-snapshot
A new tabu search heuristic for the open vehicle routing problem
inferredcites →https://doi.org/10.1057/palgrave.jors.2601848openalex-snapshot
Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
inferredcites →https://doi.org/10.1137/1.9780898718515openalex-snapshot
The Vehicle Routing Problem
inferredcites →https://doi.org/10.1137/1.9780898718515.ch3openalex-snapshot
3. Branch-And-Cut Algorithms for the Capacitated VRP
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/ijoc.7.1.1openalex-snapshot
A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
inferredcites →https://doi.org/10.1287/mnsc.6.1.80openalex-snapshot
The Truck Dispatching Problem
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.1287/opre.33.5.1050openalex-snapshot
Optimal Routing under Capacity and Distance Restrictions
inferredcites →https://doi.org/10.1287/opre.42.4.626openalex-snapshot
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
inferredcites →https://doi.org/10.1287/opre.42.5.846openalex-snapshot
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
inferredcites →https://doi.org/10.1287/trsc.30.4.379openalex-snapshot
A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
inferredcites →https://doi.org/10.2307/254187openalex-snapshot
A Heuristic Method for the Open Vehicle Routing Problem
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/3010676openalex-snapshot
Annotated Bibliographies in Combinatorial Optimization.
inferredcites →https://doi.org/10.2307/923005openalex-snapshot
Annals of Opera
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

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.4105672openalex-extracted
An Exact Algorithm for Unpaired Pickup and Delivery Vehicle Routing Problem with Multiple Commodities and Multiple Visits
inferred← citeshttps://doi.org/10.2139/ssrn.4585724openalex-extracted
Deluxing: Deep Lagrangian Underestimate Fixing for Column-Generation-Based Exact Methods
inferred← citeshttps://doi.org/10.2139/ssrn.4630549openalex-extracted
Two-Stage Learning to Branch in Branch-Price-And-Cut Algorithms for Solving Vehicle Routing Problems Exactly
inferred← citeshttps://doi.org/10.2139/ssrn.4793503openalex-extracted
A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
inferred← citeshttps://doi.org/10.2139/ssrn.5461574openalex-extracted
The Commodity Constrained Split Delivery Vehicle Routing Problem with Temperature Requirements
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0117openalex-snapshot
Branch and Cut
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0949openalex-snapshot
Exact Solution of the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1002/9781118600283.ch5openalex-snapshot
Operations Research and Goods Transportation
inferred← citeshttps://doi.org/10.1002/9781119005384.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005384.ch5openalex-snapshot
Operations Research and Goods Transportation
inferred← citeshttps://doi.org/10.1002/9781119606475.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/nav.20361openalex-snapshot
A branch‐and‐cut algorithm for the nonpreemptive swapping problem
inferred← citeshttps://doi.org/10.1002/net.20091openalex-snapshot
Exact methods based on node‐routing formulations for undirected arc‐routing problems
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.20447openalex-snapshot
A branch‐and‐cut algorithm for the preemptive swapping problem
inferred← citeshttps://doi.org/10.1002/net.20472openalex-snapshot
The vehicle routing problem with time windows and temporal dependencies
inferred← citeshttps://doi.org/10.1002/net.21459openalex-snapshot
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
inferred← citeshttps://doi.org/10.1002/net.21592openalex-snapshot
Optimal vehicle routing with lower and upper bounds on route durations
inferred← citeshttps://doi.org/10.1002/net.21685openalex-snapshot
Heuristics for a hub location‐routing problem
inferred← citeshttps://doi.org/10.1002/net.21690openalex-snapshot
A branch‐and‐cut‐and‐price algorithm for the mixed capacitated general routing problem
inferred← citeshttps://doi.org/10.1002/net.21694openalex-snapshot
The driver assignment vehicle routing problem
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.21962openalex-snapshot
Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
inferred← citeshttps://doi.org/10.1002/net.22041openalex-snapshot
A multi‐vehicle covering tour problem with speed optimization
inferred← citeshttps://doi.org/10.1002/net.22069openalex-snapshot
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
inferred← citeshttps://doi.org/10.1002/net.22183openalex-snapshot
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1002/net.22262openalex-snapshot
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs
inferred← citeshttps://doi.org/10.1002/net.22287openalex-snapshot
The Robust Vehicle Routing Problem With Synchronization: Models and Branch‐And‐Cut Algorithms
inferred← citeshttps://doi.org/10.1002/net.70000openalex-snapshot
Exact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints
inferred← citeshttps://doi.org/10.1002/net.70005openalex-snapshot
Vehicle Routing Problem With Time Windows—New Valid Inequalities From Polar Duality
inferred← citeshttps://doi.org/10.1002/net.70055openalex-snapshot
A Chance‐Constrained Model for a Production Routing Problem With Uncertain Availability of Vehicles
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/11527862_27openalex-snapshot
The Multi-depot Periodic Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_13openalex-snapshot
An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
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-4614-6243-9_11openalex-snapshot
An Approach to Assess the Impact of Dynamic Congestion in Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-8588-9_1openalex-snapshot
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-00612-9_17openalex-snapshot
Applying Multi-objective Particle Swarm Optimization for Solving Capacitated Vehicle Routing Problem with Load Balancing
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_27openalex-snapshot
A Generic Exact Solver for Vehicle Routing and Related Problems
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-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-58150-3_34openalex-snapshot
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-71158-0_23openalex-snapshot
Economic and Food Safety: Optimized Inspection Routes Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-78152-1_8openalex-snapshot
Quantitative Risk Assessment and Management of Cash-In-Transit Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-20500-2_6openalex-snapshot
A Large-Scale Tobacco 3D Bin Packing Model Based on Dual-Task Learning of Group Blocks
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-031-57603-4_16openalex-snapshot
Production Inventory Technician Routing Problem: A Bi-objective Post-sales Application
inferred← citeshttps://doi.org/10.1007/978-3-032-17625-7_2openalex-snapshot
Hybrid Learning and Optimization Methods for Solving Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-39525-2_6openalex-snapshot
An Integrated Framework for Digital Advertisement and Fleet Capacity Optimization in Long-Haul Logistics
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-18533-0_7openalex-snapshot
A Tangible Collaborative Decision Support System for Various Variants of the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-20430-7_7openalex-snapshot
Demand Uncertainty for the Location-Routing Problem with Two-dimensional Loading Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-21536-5_3openalex-snapshot
A Collaborative Spatial Decision Support System for the Capacitated Vehicle Routing Problem on a Tabletop Display
inferred← citeshttps://doi.org/10.1007/978-3-319-40159-1_11openalex-snapshot
Smart Waste Collection Platform Based on WSN and Route Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-56871-3_23openalex-snapshot
An Evolutive Tabu-Search Metaheuristic Approach for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-59105-6_4openalex-snapshot
Tabu Search and Greedy Algorithm Adaptation to Logistic Task
inferred← citeshttps://doi.org/10.1007/978-3-319-59513-9_6openalex-snapshot
Distributed Genetic Algorithms on Portable Devices for Smart Cities
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_20openalex-snapshot
Minimum Makespan Vehicle Routing Problem with Compatibility Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-65455-3_10openalex-snapshot
Blood Supply Chain Management and Future Research Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_37openalex-snapshot
Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_24openalex-snapshot
The School Bus Routing Problem: An Analysis and Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-95666-4_7openalex-snapshot
Vehicle Routing Problem for Urban Freight Transportation: A Review of the Recent Literature
inferred← citeshttps://doi.org/10.1007/978-3-319-95933-7_84openalex-snapshot
Research on Vehicle Routing Problem with Time Windows Restrictions
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-75396-4_4openalex-snapshot
Evolution of Inductive Self-organizing Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_24openalex-snapshot
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
inferred← citeshttps://doi.org/10.1007/978-3-642-13986-4_19openalex-snapshot
Automatic Link Numbering and Source Routed Multicast
inferred← citeshttps://doi.org/10.1007/978-3-642-21515-5_31openalex-snapshot
Multi-cellular-ant Algorithm for Large Scale Capacity Vehicle Route Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43871-8_58openalex-snapshot
Solving a Variant of the Hub Location-Routing Problem
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-3-662-47200-2_28openalex-snapshot
Improving Vehicle Routing Decision for Travel Agency in Chonburi, Thailand
inferred← citeshttps://doi.org/10.1007/978-981-13-0761-4_52openalex-snapshot
Vehicle Routing Problem with Time Windows Using Meta-Heuristic Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/978-981-33-4191-3_5openalex-snapshot
Capacitated Vehicle Routing Problem—A New Clustering Approach Based on Hybridization of Adaptive Particle Swarm Optimization and Grey Wolf Optimization
inferred← citeshttps://doi.org/10.1007/978-981-96-8165-5_265-1openalex-snapshot
Solution Approaches to the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/bf02941184openalex-snapshot
Annotated bibliography in vehicle routing
inferred← citeshttps://doi.org/10.1007/s00186-008-0236-7openalex-snapshot
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-009-0179-2openalex-snapshot
Heuristic and exact algorithms for the multi-pile vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-012-0289-0openalex-snapshot
A hybrid genetic algorithm for the multi-depot open vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-015-0408-9openalex-snapshot
An improved formulation for the multi-depot open vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-017-0494-yopenalex-snapshot
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-020-00615-8openalex-snapshot
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-024-00781-zopenalex-snapshot
New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty
inferred← citeshttps://doi.org/10.1007/s00500-016-2433-2openalex-snapshot
A novel versatile architecture for autonomous underwater vehicle’s motion planning and task assignment
inferred← citeshttps://doi.org/10.1007/s00521-021-06587-2openalex-snapshot
A MAS approach for vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10100-006-0168-3openalex-snapshot
Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
inferred← citeshttps://doi.org/10.1007/s10100-006-0169-2openalex-snapshot
Synchronized routing of seasonal products through a production/distribution network
inferred← citeshttps://doi.org/10.1007/s10100-010-0158-3openalex-snapshot
Exact hybrid algorithms for solving a bi-objective vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10107-002-0336-8openalex-snapshot
Multistars, partial multistars and the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0606-3openalex-snapshot
Decomposition and Dynamic Cut Generation in Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0611-6openalex-snapshot
Formulations and Valid Inequalities for the Heterogeneous 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-005-0652-xopenalex-snapshot
Projection results for vehicle routing
inferred← citeshttps://doi.org/10.1007/s10107-005-0662-8openalex-snapshot
A new ILP-based refinement heuristic for Vehicle Routing Problems
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-012-0561-8openalex-snapshot
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
inferred← citeshttps://doi.org/10.1007/s10107-020-01484-3openalex-snapshot
Outer-product-free sets for polynomial optimization and oracle-based cuts
inferred← citeshttps://doi.org/10.1007/s10107-020-01523-zopenalex-snapshot
A generic exact solver for vehicle routing and related problems
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/s10287-012-0152-4openalex-snapshot
The coastal seaspace patrol sector design and allocation problem
inferred← citeshttps://doi.org/10.1007/s10288-007-0039-3openalex-snapshot
Solving the capacitated location-routing problem
inferred← citeshttps://doi.org/10.1007/s10288-007-0047-3openalex-snapshot
Combinatorial optimization and Green Logistics
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-010-0140-xopenalex-snapshot
Enhanced mixed integer programming techniques and routing problems
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/s10288-012-0226-8openalex-snapshot
Dynamic vehicle routing: Solution methods and computational tools
inferred← citeshttps://doi.org/10.1007/s10288-017-0365-zopenalex-snapshot
Mathematical models and decomposition algorithms for cutting and packing 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-010-0748-4openalex-snapshot
A new mixed integer linear model for a rich vehicle routing problem with docking constraints
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/s10479-026-07150-9openalex-snapshot
Supermarket-chain grocery delivery optimization through courier coordination
inferred← citeshttps://doi.org/10.1007/s10586-021-03354-9openalex-snapshot
Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/s10589-025-00713-9openalex-snapshot
The Capacitated Vehicle Routing Problem with Planned Downtime
inferred← citeshttps://doi.org/10.1007/s10661-019-7975-1openalex-snapshot
Optimization of municipal solid waste collection and transportation routes, through linear programming and geographic information system: a case study from Şanlıurfa, Turkey
inferred← citeshttps://doi.org/10.1007/s10732-010-9126-2openalex-snapshot
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
inferred← citeshttps://doi.org/10.1007/s10732-018-9392-yopenalex-snapshot
A local branching matheuristic for the multi-vehicle routing problem with stochastic demands
inferred← citeshttps://doi.org/10.1007/s10846-018-0793-9openalex-snapshot
Hybrid Motion Planning Task Allocation Model for AUV’s Safe Maneuvering in a Realistic Ocean Environment
inferred← citeshttps://doi.org/10.1007/s10846-022-01732-yopenalex-snapshot
Robust Task Allocation for Multiple Cooperative Robotic Vehicles Considering Node Position Uncertainty
inferred← citeshttps://doi.org/10.1007/s11128-024-04497-5openalex-snapshot
A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/s11590-012-0550-0openalex-snapshot
Modeling and solving profitable location and distribution problems
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-017-1192-zopenalex-snapshot
BPPLIB: a library for bin packing and cutting stock problems
inferred← citeshttps://doi.org/10.1007/s11590-018-1282-6openalex-snapshot
A branch and cut algorithm for the capacitated star–star telecommunication network problem
inferred← citeshttps://doi.org/10.1007/s11704-017-6418-9openalex-snapshot
An improved fireworks algorithm for the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s11750-010-0144-xopenalex-snapshot
Routing problems with loading constraints
inferred← citeshttps://doi.org/10.1007/s11750-018-0469-4openalex-snapshot
Disruption management in vehicle routing and scheduling for road freight transport: a review
inferred← citeshttps://doi.org/10.1007/s11750-020-00590-xopenalex-snapshot
A Branch & Cut algorithm for the prize-collecting capacitated location routing problem
inferred← citeshttps://doi.org/10.1007/s11768-022-00091-1openalex-snapshot
A hybrid genetic algorithm for the electric vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1007/s12293-024-00412-8openalex-snapshot
Exploring dynamic population Island genetic algorithm for solving the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s12351-019-00543-8openalex-snapshot
Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office
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/s12532-019-00174-2openalex-snapshot
K-adaptability in two-stage mixed-integer robust optimization
inferred← citeshttps://doi.org/10.1007/s13675-017-0089-zopenalex-snapshot
New exact solution approaches for the split delivery vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s13676-013-0023-3openalex-snapshot
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence
inferred← citeshttps://doi.org/10.1007/s13676-018-0126-yopenalex-snapshot
A hybrid recourse policy for the vehicle routing problem with stochastic demands
inferred← citeshttps://doi.org/10.1007/s40747-021-00293-1openalex-snapshot
Data-driven optimization for last-mile delivery
inferred← citeshttps://doi.org/10.1007/s42452-020-2076-xopenalex-snapshot
Route optimization for warehouse order picking operations via vehicle routing and simulation
inferred← citeshttps://doi.org/10.1007/s43069-020-00042-zopenalex-snapshot
The Inventory Routing Problem with Demand Moves
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.1007/s43069-023-00220-9openalex-snapshot
Preprocessing to Reduce Vehicle Capacity for Routing Problems
inferred← citeshttps://doi.org/10.1007/s44196-025-01059-0openalex-snapshot
A Parallel Hybrid Genetic Search for Solving the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-385202-1.00008-6openalex-snapshot
The Vehicle-Routing Problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-814242-4.00010-7openalex-snapshot
Decision Making Using Exact Optimization Methods in Sustainable Transportation
inferred← citeshttps://doi.org/10.1016/b978-0-444-53711-9.50102-4openalex-snapshot
A Hybrid Branch-and-Cut Approach for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.05.024openalex-snapshot
Two effective simulated annealing algorithms for the Location-Routing Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110309openalex-snapshot
Combining Genetic Local Search into a Multi-Population Imperialist Competitive Algorithm for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113280openalex-snapshot
ADNS: An adaptive dynamic neighborhood search method guided by joint learning heuristics and corresponding hyperparameters
inferred← citeshttps://doi.org/10.1016/j.cie.2008.06.012openalex-snapshot
Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2013.05.021openalex-snapshot
Customer-oriented school bus operations for childcare centers in Korea
inferred← citeshttps://doi.org/10.1016/j.cie.2017.03.022openalex-snapshot
Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2018.04.032openalex-snapshot
Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cie.2018.05.010openalex-snapshot
The two echelon open location routing problem: Mathematical model and hybrid heuristic
inferred← citeshttps://doi.org/10.1016/j.cie.2018.05.013openalex-snapshot
Persistent UAV delivery logistics: MILP formulation and efficient heuristic
inferred← citeshttps://doi.org/10.1016/j.cie.2019.02.032openalex-snapshot
A column generation algorithm for vehicle scheduling and routing problems
inferred← citeshttps://doi.org/10.1016/j.cie.2019.03.047openalex-snapshot
Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: Mathematical modeling and solution approach
inferred← citeshttps://doi.org/10.1016/j.cie.2019.05.002openalex-snapshot
Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.cie.2019.07.016openalex-snapshot
Optimal approach to game scheduling of multiple round-robin tournament: Korea professional baseball league in focus
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.02.023openalex-snapshot
The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2005.09.012openalex-snapshot
A general heuristic for vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.cor.2006.10.020openalex-snapshot
An optimization algorithm for the inventory routing problem with continuous moves
inferred← citeshttps://doi.org/10.1016/j.cor.2008.09.008openalex-snapshot
Exploiting sparsity in pricing routines for the capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2008.11.003openalex-snapshot
A hybrid evolution strategy for the open vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2009.06.014openalex-snapshot
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2009.06.021openalex-snapshot
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
inferred← citeshttps://doi.org/10.1016/j.cor.2010.02.010openalex-snapshot
An ILP improvement procedure for the Open Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2010.09.019openalex-snapshot
A Branch-and-Cut method for the Capacitated Location-Routing Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.04.015openalex-snapshot
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach
inferred← citeshttps://doi.org/10.1016/j.cor.2012.02.026openalex-snapshot
Models and hybrid methods for the onshore wells maintenance problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.04.010openalex-snapshot
A branch-price-and-cut algorithm for the workover rig routing problem
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.014openalex-snapshot
A lower bound for the Node, Edge, and Arc Routing Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2013.12.006openalex-snapshot
Comparing sourcing strategies in two-echelon supply chains
inferred← citeshttps://doi.org/10.1016/j.cor.2014.01.011openalex-snapshot
The production routing problem: A review of formulations and solution algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2014.03.028openalex-snapshot
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
inferred← citeshttps://doi.org/10.1016/j.cor.2014.07.003openalex-snapshot
Battery swap station location-routing problem with capacitated electric vehicles
inferred← citeshttps://doi.org/10.1016/j.cor.2016.12.022openalex-snapshot
An exact algorithm for a Vehicle-and-Driver Scheduling Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.03.010openalex-snapshot
A Variable MIP Neighborhood Descent algorithm for managing inventory and distribution of cash in automated teller machines
inferred← citeshttps://doi.org/10.1016/j.cor.2017.08.015openalex-snapshot
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.05.011openalex-snapshot
Managing platelet supply through improved routing of blood collection vehicles
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104833openalex-snapshot
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104944openalex-snapshot
The two-echelon inventory-routing problem with fleet management
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105375openalex-snapshot
The joint network vehicle routing game with optional customers
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105870openalex-snapshot
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106071openalex-snapshot
Opportunities for reinforcement learning in stochastic dynamic vehicle routing
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106232openalex-snapshot
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106286openalex-snapshot
A two-stage stochastic location–routing problem for electric vehicles fast charging
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106434openalex-snapshot
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106467openalex-snapshot
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106556openalex-snapshot
Routing and scheduling of platform supply vessels in offshore oil and gas logistics
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106585openalex-snapshot
Shore hydrogen deployment problem in green ports
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106600openalex-snapshot
Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106869openalex-snapshot
A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106883openalex-snapshot
A novel mixed-integer linear programming formulation for continuous-time inventory routing
showing the first 200 of 564
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.