Numerical analysis of algorithms for solving bicriteria discrete programming problems (Q1608267)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1779327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical analysis of algorithms for solving bicriteria discrete programming problems |
scientific article; zbMATH DE number 1779327 |
Statements
Numerical analysis of algorithms for solving bicriteria discrete programming problems (English)
0 references
23 November 2002
0 references
The authors present results of numerical analysis of algorithms for solving a bicriteria assignment, spanning tree, and traveling salesman problems. All the algorithms under consideration are based on the linear convolution of criteria. Dependence of the number of effective points found by algorithms on the length of the partitioning interval is analyzed.
0 references
multicriteria discrete programming
0 references
assignment
0 references
spanning
0 references
traveling salesman problem
0 references
algorithm
0 references
convolution
0 references
effective points
0 references
minsum-min-sum criteria
0 references
0 references
0.9038414
0 references
0.8879355
0 references
0.8868926
0 references
0.88667154
0 references
0 references
