On the public citation graph
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
0 signed · 64 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/3-540-64359-1_691openalex-snapshot
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet
inferredcites →https://doi.org/10.1007/978-0-387-77778-8openalex-snapshot
The Vehicle Routing Problem: Latest Advances and New Challenges
inferredcites →https://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
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/bf01720070openalex-snapshot
A comparison of techniques for solving the fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1007/bfb0055938openalex-snapshot
An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet
inferredcites →https://doi.org/10.1007/bfb0121103openalex-snapshot
A new heuristic for determining fleet size and composition
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-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.1016/0305-0548(84)90007-8openalex-snapshot
The fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1016/0305-0548(91)90028-popenalex-snapshot
A new heuristic for the fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90220-hopenalex-snapshot
Incorporating vehicle routing into the vehicle fleet composition 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/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.1016/s0898-1221(99)91259-2openalex-snapshot
Integer and combinatorial optimization
inferredcites →https://doi.org/10.1016/s0927-0507(06)14006-2openalex-snapshot
Chapter 6 Vehicle Routing
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.2600763openalex-snapshot
The Fleet Size and Mix Vehicle Routing Problem with Time Windows
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.1057/palgrave.jors.2601422openalex-snapshot
New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/opre.1040.0111openalex-snapshot
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
inferredcites →https://doi.org/10.1287/trsc.1070.0190openalex-snapshot
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
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/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.22028openalex-snapshot
A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
inferred← citeshttps://doi.org/10.1007/978-3-031-43612-3_26openalex-snapshot
Ridesharing in Rural Areas with Autonomous Electric Vehicles and Interrelated Trips
inferred← citeshttps://doi.org/10.1007/s00500-016-2406-5openalex-snapshot
An exact approach for the grocery delivery problem in urban areas
inferred← citeshttps://doi.org/10.1007/s10288-010-0141-9openalex-snapshot
Exact and heuristic algorithms for 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-017-2642-9openalex-snapshot
A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
inferred← citeshttps://doi.org/10.1007/s11135-021-01282-9openalex-snapshot
On understanding the impacts of shared public transportation on urban traffic and road safety using an agent-based simulation with heterogeneous fleets: a case study of Casablanca city
inferred← citeshttps://doi.org/10.1016/j.cor.2010.03.015openalex-snapshot
Industrial aspects and literature survey: Fleet composition and routing
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.energy.2018.01.120openalex-snapshot
Optimization of a small-scale LNG supply chain
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.107openalex-snapshot
Survey of Green Vehicle Routing Problem: Past and future trends
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107239openalex-snapshot
On the capacity inequalities for the heterogeneous vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.trb.2019.03.004openalex-snapshot
The electric autonomous dial-a-ride problem
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.06.002openalex-snapshot
Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem
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.2021.102554openalex-snapshot
Stochastic fleet mix optimization: Evaluating electromobility in urban logistics
inferred← citeshttps://doi.org/10.1016/j.tre.2023.103095openalex-snapshot
Deep attention models with dimension-reduction and gate mechanisms for solving practical time-dependent vehicle routing problems
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.1021/acs.iecr.7b01061openalex-snapshot
Optimal Design of a Small-Scale LNG Supply Chain Combining Sea and Land Transports
inferred← citeshttps://doi.org/10.1080/00207543.2013.855337openalex-snapshot
Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm
inferred← citeshttps://doi.org/10.1080/0740817x.2014.905737openalex-snapshot
Trailer fleet planning for industrial gas distribution
inferred← citeshttps://doi.org/10.1109/clei.2015.7359988openalex-snapshot
An application of ILS heuristic to Periodic Vehicle Routing Problem with heterogeneous fleet and fixed costs
inferred← citeshttps://doi.org/10.1109/jsee.2013.00013openalex-snapshot
Intermediate carriers for UAV swarms: Problem of fleet composition
inferred← citeshttps://doi.org/10.1109/plmo62307.2024.10887165openalex-snapshot
Problem of Building Circular Routes for the Delivery of Discrete Cargo in the Transport Network
inferred← citeshttps://doi.org/10.1287/ijoc.2019.0923openalex-snapshot
Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
inferred← citeshttps://doi.org/10.1287/opre.2021.2126openalex-snapshot
A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
inferred← citeshttps://doi.org/10.2139/ssrn.5813536openalex-snapshot
Mathematical Programming Approaches for Exact Solutionof the First-Mile Ride-Sharing Problem
inferred← citeshttps://doi.org/10.3384/ecp17138332openalex-snapshot
A multi-period optimization model for the design of new LNG supply chains
inferred← citeshttps://doi.org/10.3390/en13246704openalex-snapshot
Design of Small LNG Supply Chain by Multi-Period Optimization
inferred← citeshttps://doi.org/10.34229/2707-451x.24.2.2openalex-snapshot
Mathematical Models of the Problem of Constructing Delivery Routes of Cargo in the Internal Zones of Trunk Nodes of a Hierarchical Transport Network
inferred← citeshttps://doi.org/10.46254/sa03.20220331openalex-snapshot
Distribution Route Optimization using Fleet Size and Mix Vehicle Routing Problem: a Case Study at Bali-Nusa Tenggara LNG Distribution
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/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.