Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/11906
Title: | Benders Decomposition Approach to Set Covering Problems Satisfying Almost the Consecutive Ones Property |
Authors: | Salim, Haddadi Nacira, Hamidane |
Keywords: | Set Covering Benders Decomposition Consecutive Ones Property Consecutive Block Minimisation |
Issue Date: | 3-Nov-2016 |
Abstract: | Although in the actual phase, we are evaluating it, the algorithm pre- sented in this paper is designed for solving real world set covering instances arising from railway public transportation in Germany (Deutsche Bahn). These instances, with large sizes, are characterized by a special pattern. The binary matrices they exhibit, have almost consecutive ones property. Taking advantage of this nice structure, we present a decomposition of the SCP into a mixed linear-integer program, and we present a Benderslike algorithm. We end the paper with the computational experience where twenty randomly generated instances are run. |
URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/11906 |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Benders Decomposition Approach to Set covering problems satisfing almost the consecutive ones proerty.pdf | 144,88 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.