A new subtour elimination constraint for the vehicle routing problem
type: Item
instance of: scholarly article
title: A new subtour elimination constraint for the vehicle routing problem
zbMATH Open document ID: 0924.90057
DOI: 10.1016/0377-2217(94)00332-7
author: N. R. Achuthan
author: Louis Caccetta
author: S. P. Hill
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1252863
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: integer programming
zbMATH Keywords: vehicle routing
describes a project that uses: CPLEX
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00332-7
OpenAlex ID: W1968665498
cites work: Integer linear programming formulation for a vehicle routing problem
cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem
cites work: Q3688098
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
cites work: An exact algorithm for the asymmetrical capacitated vehicle routing problem
cites work: Q3751354
cites work: Optimal Routing under Capacity and Distance Restrictions
description: scientific article; zbMATH DE number 1252863