Computing a K-independent set of maximal weight on a partially ordered set: a research case history
This is a tutorial paper presenting the research carried out on the Sperner-Erdös problem, that is the problem of computing a Maximal Weighted K-Independent Set on a Partially Ordered set. Results are shown in the same order as the research was made: analysis and solution to the Sperner [sub]problem...
| Autor: | |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 1981 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2099/4406 |
| Acesso em linha: | https://hdl.handle.net/2099/4406 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Operations research Investigació operativa Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science |
| Resumo: | This is a tutorial paper presenting the research carried out on the Sperner-Erdös problem, that is the problem of computing a Maximal Weighted K-Independent Set on a Partially Ordered set. Results are shown in the same order as the research was made: analysis and solution to the Sperner [sub]problem (K=1) and generalisation of this result yielding a polynomial solution to the Sperner-Erdös problem. |
|---|