A Scheme of Independent Calculations in a Precedence Constrained Routing Problem

DOI10.1007/978-3-319-44914-2_10zbMath1388.90016OpenAlexW2558180421MaRDI QIDQ3133206

Alekseĭ Mikhaĭlovich Grigor'Ev, A. G. Chentsov

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_10

zbMATH Keywords

dynamic programmingparallel algorithmsprecedence constraintsrouting problemsequential ordering problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (4)

A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

This page was built for publication: A Scheme of Independent Calculations in a Precedence Constrained Routing Problem