Detecting constraint redundancy in 0-1 linear programming problems
Đã lưu trong:
| Tác giả: | |
|---|---|
| Định dạng: | artículo original |
| Trạng thái: | Versión publicada |
| Ngày xuất bản: | 2001 |
| Miêu tả: | In this paper we present a procedure for obtaining upper bounds on a linear function by means of certain families of packings, coverings and special ordered sets. We also present a new method for detecting redundant constraints in 0-1 linear programming problems based on these bounds that allows consideration of several constraints jointly. Furthermore, we show a redundancy situation which is detected by this new method, but not by the traditional methods, which consider the constraints individually. |
| Quốc gia: | Portal de Revistas UCR |
| Tổ chức giáo dục: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Ngôn ngữ: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/193 |
| Truy cập trực tuyến: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/193 |
| Từ khóa: | Redundant constraints packings coverings special ordered sets admissible families Restricciones redundantes empaquetamientos recubrimientos conjuntos ordenados especiales familias admisibles |