An enumerative procedure for identifying maximal covers
সংরক্ষণ করুন:
| লেখক: | |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 2003 |
| বিবরন: | In this paper we present an enumerative procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. The inequalities induced by these maximal covers are not dominated by the inequality induced by any other cover implied by the knapsack constraint. Thus, their identification can help to tighten 0-1 models. On the other hand, we present an improvement on a procedure taken from the literature for identifying certain maximal covers. Some comparative computational experiments where both procedures have been applied to randomly generated knapsack constraints are also reported. |
| দেশ: | Portal de Revistas UCR |
| প্রতিষ্ঠান: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| ভাষা: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/233 |
| অনলাইন ব্যবহার করুন: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/233 |
| মুখ্য শব্দ: | Maximal covers tighter formulations knapsack constraints dominated inequalities Cubrimientos maximales formulaciones más fuertes restricciones de tipo mochila desigualdades dominadas |