OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218): Difference between revisions

Latest revision as of 01:46, 17 August 2024

scientific article; zbMATH DE number 7255656

Language	Label	Description	Also known as
English	OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS	scientific article; zbMATH DE number 7255656

Statements

instance of

scholarly article

0 references

title

OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (English)

0 references

author

A. G. Chentsov

0 references

Alekseĭ Mikhaĭlovich Grigor'Ev

0 references

Alexey Chentsov

0 references

published in

Ural mathematical journal

0 references

publication date

5 October 2020

0 references

full work available at URL

http://mathnet.ru/eng/umj62

0 references

zbMATH Keywords

dynamic programming

0 references

route

0 references

sequencing

0 references

precedence constraints

0 references

parallel computation

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The traveling salesman problem. I: Theoretical issues

0 references

The traveling salesman problem. II: Exact methods

0 references

The traveling salesman problem. Approximate algorithms

0 references

The traveling salesman problem and its variations

0 references

In Pursuit of the Traveling Salesman

0 references

Route problem with constraints depending on a list of tasks

0 references

A discrete-continuous routing problem with precedence constraints

0 references

A Scheme of Independent Calculations in a Precedence Constrained Routing Problem

0 references

An exact algorithm with linear complexity for a problem of visiting megalopolises

0 references

Q5549798

0 references

Q5565769

0 references

Routing under constraints: problem of visit to megalopolises

0 references

On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

0 references

Q2794992

0 references

Elements of dynamic programming in extremal routing problems

0 references

A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)

0 references

On one routing problem modeling movement in radiation fields

0 references

Cutting path optimization in CNC cutting processes using a two-step genetic algorithm

0 references

Q3161863

0 references

Dynamic Programming Treatment of the Travelling Salesman Problem

0 references

A Dynamic Programming Approach to Sequencing Problems

0 references

An inexact algorithm for the sequential ordering problem

0 references

Extremal routing problem with internal losses

0 references

Identifiers

zbMATH Open document ID

1448.90015

0 references

DOI

10.15826/umj.2018.2.006

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5125218

@@ Property / OpenAlex ID @@
+W2908249808
@@ Property / OpenAlex ID: W2908249808 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem. I: Theoretical issues
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem. II: Exact methods
@@ Property / cites work: The traveling salesman problem. II: Exact methods / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem. Approximate algorithms
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+In Pursuit of the Traveling Salesman
@@ Property / cites work: In Pursuit of the Traveling Salesman / rank @@
+Normal rank
@@ Property / cites work @@
+Route problem with constraints depending on a list of tasks
+Normal rank
@@ Property / cites work @@
+A discrete-continuous routing problem with precedence constraints
+Normal rank
@@ Property / cites work @@
+A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm with linear complexity for a problem of visiting megalopolises
+Normal rank
@@ Property / cites work @@
+Q5549798
@@ Property / cites work: Q5549798 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5565769
@@ Property / cites work: Q5565769 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing under constraints: problem of visit to megalopolises
+Normal rank
@@ Property / cites work @@
+On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
+Normal rank
@@ Property / cites work @@
+Q2794992
@@ Property / cites work: Q2794992 / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of dynamic programming in extremal routing problems
+Normal rank
@@ Property / cites work @@
+A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
+Normal rank
@@ Property / cites work @@
+On one routing problem modeling movement in radiation fields
+Normal rank
@@ Property / cites work @@
+Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
+Normal rank
@@ Property / cites work @@
+Q3161863
@@ Property / cites work: Q3161863 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+An inexact algorithm for the sequential ordering problem
+Normal rank
@@ Property / cites work @@
+Extremal routing problem with internal losses
@@ Property / cites work: Extremal routing problem with internal losses / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128651844
@@ Property / Wikidata QID: Q128651844 / rank @@
+Normal rank