A model of "nonadditive" routing problem where the costs depend on the set of pending tasks › Research Explorer

A model of "nonadditive" routing problem where the costs depend on the set of pending tasks

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.14529/mmp150102
Final published version

Original language	English
Pages (from-to)	24-45
Number of pages	22
Journal	Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software
Volume	8
Issue number	1
DOIs	https://doi.org/10.14529/mmp150102
Publication status	Published - 1 Jan 2015

WoS ResearchAreas Categories

Mathematics, Applied

GRNTI

27.41.00

Research areas

Dynamic programming, Precedence constraints, Route, Sequential ordering problem

Level of Research Output

VAK List

ASJC Scopus subject areas

Computational Mathematics
Computational Theory and Mathematics
Modelling and Simulation

ID: 315546