Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (Q1062913)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions |
scientific article; zbMATH DE number 3916022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions |
scientific article; zbMATH DE number 3916022 |
Statements
Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (English)
0 references
1985
0 references
For a certain class of combinatorial optimization problems the author introduces an exchange pairs (EP) set. Using the EP set the author constructs some sort of gradient and solves the problem by a variant of a greedy method. The computational complexity of the greedy method depends heavily on the complexity of constructing a generation set for the EP set.
0 references
k-best solutions
0 references
combinatorial optimization
0 references
exchange properties
0 references
adjacency
0 references
gradient
0 references
greedy method
0 references
0 references
0.7145993113517761
0 references
