On the public citation graph

A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem

https://doi.org/10.1002/net.20330

0 signed · 82 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.1007/bf01589353openalex-snapshot

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

inferredcites →https://doi.org/10.1007/s10107-003-0481-8openalex-snapshot

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

inferredcites →https://doi.org/10.1007/s10107-005-0611-6openalex-snapshot

Formulations and Valid Inequalities for the Heterogeneous 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.1007/s10107-006-0043-yopenalex-snapshot

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

inferredcites →https://doi.org/10.1016/0305-0548(84)90007-8openalex-snapshot

The fleet size and mix vehicle routing problem

inferredcites →https://doi.org/10.1016/j.cor.2005.02.023openalex-snapshot

The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem

inferredcites →https://doi.org/10.1016/j.cor.2005.08.002openalex-snapshot

A column generation approach to the heterogeneous fleet vehicle routing problem

inferredcites →https://doi.org/10.1016/s0167-739x(98)00034-xopenalex-snapshot

A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet

inferredcites →https://doi.org/10.1016/s0305-0548(98)00100-2openalex-snapshot

A tabu search heuristic for the heterogeneous fleet vehicle routing problem

inferredcites →https://doi.org/10.1016/s0377-2217(01)00237-5openalex-snapshot

A sweep-based algorithm for the fleet size and mix vehicle routing problem

inferredcites →https://doi.org/10.1051/ro:1999101openalex-snapshot

A heuristic column generation method for the heterogeneous fleet VRP

inferredcites →https://doi.org/10.1057/palgrave.jors.2601344openalex-snapshot

Tabu search variants for the mix fleet vehicle routing problem

inferredcites →https://doi.org/10.1287/ijoc.1040.0117openalex-snapshot

The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

inferredcites →https://doi.org/10.1287/opre.26.1.86openalex-snapshot

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

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.4682185openalex-extracted

Formulations and Branch-and-Cut Algorithms for the Heterogeneous Fleet Vehicle Routing Problem with Due Dates

inferred← citeshttps://doi.org/10.1002/nav.22151openalex-snapshot

A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup

inferred← citeshttps://doi.org/10.1002/net.21526openalex-snapshot

Branch‐and‐cut algorithms for the vehicle routing problem with trailers and transshipments

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.1007/978-3-031-49662-2_11openalex-snapshot

An Urban-Scale Application of the Problem of Designing Green Tourist Trips with Time Windows

inferred← citeshttps://doi.org/10.1007/978-3-031-94630-1_10openalex-snapshot

A Two-Phase Heuristic and Genetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_18openalex-snapshot

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-642-32081-1_10openalex-snapshot

Environmental Issues in Vehicle Routing Problems

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/s10479-009-0650-0openalex-snapshot

Exact algorithms for routing problems under vehicle capacity constraints

inferred← citeshttps://doi.org/10.1007/s10479-017-2642-9openalex-snapshot

A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet

inferred← citeshttps://doi.org/10.1007/s10732-011-9186-yopenalex-snapshot

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1007/s10951-017-0523-3openalex-snapshot

Task assignment with start time-dependent processing times for personnel at check-in counters

inferred← citeshttps://doi.org/10.1007/s12532-010-0019-zopenalex-snapshot

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems

inferred← citeshttps://doi.org/10.1007/s12532-012-0047-yopenalex-snapshot

The time dependent traveling salesman problem: polyhedra and algorithm

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.1016/j.cie.2024.110463openalex-snapshot

A branch-and-price algorithm for the two-echelon inventory-routing problem

inferred← citeshttps://doi.org/10.1016/j.cor.2018.09.007openalex-snapshot

Layered graph approaches for combinatorial optimization problems

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.105034openalex-snapshot

A hybrid adaptive large neighborhood search heuristic for the team orienteering problem

inferred← citeshttps://doi.org/10.1016/j.cor.2021.105475openalex-snapshot

A POPMUSIC matheuristic for the capacitated vehicle routing problem

inferred← citeshttps://doi.org/10.1016/j.ejor.2012.03.016openalex-snapshot

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1016/j.ejor.2013.09.014openalex-snapshot

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

inferred← citeshttps://doi.org/10.1016/j.ejor.2015.07.020openalex-snapshot

Thirty years of heterogeneous vehicle routing

inferred← citeshttps://doi.org/10.1016/j.ejor.2016.04.059openalex-snapshot

Orienteering Problem: A survey of recent variants, solution approaches and applications

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.2018.04.009openalex-snapshot

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems

inferred← citeshttps://doi.org/10.1016/j.eswa.2018.07.034openalex-snapshot

The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory

inferred← citeshttps://doi.org/10.1016/j.omega.2016.05.001openalex-snapshot

Design-balanced capacitated multicommodity network design with heterogeneous assets

inferred← citeshttps://doi.org/10.1016/j.orl.2010.04.008openalex-snapshot

Improved lower bounds for the Split Delivery Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1016/j.seps.2011.05.002openalex-snapshot

Transportation in disaster response operations

inferred← citeshttps://doi.org/10.1016/j.seps.2016.04.002openalex-snapshot

Bi-criteria solid transportation problem with substitutable and damageable items in disaster response operations on fuzzy rough environment

inferred← citeshttps://doi.org/10.1016/j.trb.2019.03.009openalex-snapshot

A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows

inferred← citeshttps://doi.org/10.1016/j.trb.2024.103104openalex-snapshot

Formulations and branch-and-cut algorithms for the heterogeneous fleet vehicle routing problem with soft time deadlines

inferred← citeshttps://doi.org/10.1016/j.trc.2010.07.008openalex-snapshot

A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows

inferred← citeshttps://doi.org/10.1016/j.trd.2013.04.001openalex-snapshot

Heterogeneous fixed fleet vehicle routing considering carbon emission

inferred← citeshttps://doi.org/10.1016/j.tre.2015.12.001openalex-snapshot

A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph

inferred← citeshttps://doi.org/10.1016/j.tre.2021.102223openalex-snapshot

Economical-traveling-distance-based fleet composition with fuel costs: An application in petrol distribution

inferred← citeshttps://doi.org/10.1016/j.tre.2024.103847openalex-snapshot

Optimizing first-and-last-mile ridesharing services with a heterogeneous vehicle fleet and time-dependent travel times

inferred← citeshttps://doi.org/10.1017/pds.2023.364openalex-snapshot

TRANSPORT EFFICIENCY OF DELIVERY TRUCKS: A STUDY OF COUPLING VEHICLE DESIGN AND TRANSPORT SYSTEM THROUGH FUNCTIONAL MODELLING AND OPTIMISATION

inferred← citeshttps://doi.org/10.1057/jors.2015.48openalex-snapshot

An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation

inferred← citeshttps://doi.org/10.1057/s41274-017-0231-6openalex-snapshot

A branch-cut-and-price algorithm for the generalized vehicle routing problem

inferred← citeshttps://doi.org/10.1080/00207543.2016.1251625openalex-snapshot

Order picking problems under weight, fragility and category constraints

inferred← citeshttps://doi.org/10.1080/08839514.2014.927680openalex-snapshot

Applied Genetic Algorithm for Solving Rich VRP

inferred← citeshttps://doi.org/10.1109/access.2024.3406222openalex-snapshot

Optimizing Maritime Passenger Transfer in Rich Vehicle Routing Problem Using a Hybrid Genetic Algorithm

inferred← citeshttps://doi.org/10.1109/access.2025.3650745openalex-snapshot

Iterated Greedy Algorithm for Vehicle Routing Problem With Parcel Lockers

inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.27openalex-snapshot

Application of Adaptive Genetic Algorithm for Multimodal Transportation Logistics Distribution Routing Problem

inferred← citeshttps://doi.org/10.1109/icosc.2017.7958650openalex-snapshot

A multi-objective optimization of Multi-depot Fleet Size and Mix Vehicle Routing Problem with time window

inferred← citeshttps://doi.org/10.1186/s40649-020-00084-7openalex-snapshot

A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem

inferred← citeshttps://doi.org/10.1287/ijoc.2016.0744openalex-snapshot

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1287/ijoc.2018.0854openalex-snapshot

An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems

inferred← citeshttps://doi.org/10.1287/opre.2023.0398openalex-snapshot

DeLuxing: Deep Lagrangian Underestimate Fixing for Column-Generation-Based Exact Methods

inferred← citeshttps://doi.org/10.1287/opre.2023.2458openalex-snapshot

Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems

inferred← citeshttps://doi.org/10.1287/trsc.2018.0878openalex-snapshot

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing

inferred← citeshttps://doi.org/10.1287/trsc.2019.0900openalex-snapshot

Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm

inferred← citeshttps://doi.org/10.1287/trsc.2019.0964openalex-snapshot

A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy

inferred← citeshttps://doi.org/10.1287/trsc.2022.1136openalex-snapshot

A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.17482/uumfd.455283openalex-snapshot

AFET SONRASI YARDIM MALZEMESİ DAĞITIMI İÇİN ROTA ÜRETME-ELEME ALGORİTMASI VE TAMSAYILI PROGRAMLAMA KULLANIMI

inferred← citeshttps://doi.org/10.17771/pucrio.acad.24379openalex-snapshot

EXACT ALGORITHMS FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

inferred← citeshttps://doi.org/10.36079/lamintang.ijai-0101.9openalex-snapshot

Solving Rich Vehicle Routing Problem Using Three Steps Heuristic

inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.823309openalex-snapshot

Análise de algoritmos heurísticos para problemas "ricos'' de roteamento de veículos

inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.839134openalex-snapshot

Uma abordagem híbrida ao problema de roteirização dinâmica de veículos com janela de tempo

inferred← citeshttps://doi.org/10.6084/m9.figshare.14432579openalex-snapshot

Additional file of A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem

inferred← citeshttps://doi.org/10.69997/sct.157285openalex-snapshot

A novel decomposition-based approach to solve heterogeneous capacitated vehicle routing problems

inferred← citeshttps://doi.org/10.70675/5c5f7d17z2019z454fz9e95z6ed088c66346openalex-snapshot

Transport de marchandises en ville : tournées de véhicules hétérogène avec contraintes de chargement tridimensionnelles

inferred← citeshttps://doi.org/10.70675/aaec8631z0528z4a1az91e9zc037db811e06openalex-snapshot

Résolution de problèmes réalistes de tournées à flotte hétérogène en milieu urbain : vers un solveur adaptatif mêlant recherche opérationnelle et apprentissage automatique

inferred← citeshttps://doi.org/10.70675/f5c5cc2bz4b0dz4211z9463z4202ce541e62openalex-snapshot

Optimisation de la chaine logistique des déchets non dangereux

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.