6533b825fe1ef96bd12830fa

RESEARCH PRODUCT

Polyhedral results for a vehicle routing problem

Vicente CamposEnrique MotaÁNgel Corberán

subject

Discrete mathematicsFacet (geometry)Information Systems and ManagementGeneral Computer ScienceDimension (graph theory)Structure (category theory)PolytopeManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringCombinatoricsModeling and SimulationVehicle routing problemRouting (electronic design automation)Integer programmingVertex enumeration problemMathematics

description

Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.

yearjournalcountryeditionlanguage
1991-05-01European Journal of Operational Research
https://doi.org/10.1016/0377-2217(91)90337-u