No label defined (Q4382079)
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 1134606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1134606 |
Statements
26 March 1998
0 references
assignment problem
0 references
solvability
0 references
0.8015764951705933
0 references
0.7799340486526489
0 references
0.774632453918457
0 references
The paper deals with some special assignment problem, which arises in transport systems. In the introduction the author briefly overviews former results on the classical assignment problem, its generalized forms and then formulates the main problem to be considered. The next two chapters deal with the solvability of the problem. The author describes the construction of an initial solution for a well-known simplex method and discusses some heuristic methods, based on hill-climbing and gradient methods. The forth chapter contains results of the comparison tests of the methods described in the previous chapters.
0 references