Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2924
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Salim Haddadi and Nacira Hamidane | - |
dc.date.accessioned | 2013-12-19T15:23:18Z | - |
dc.date.available | 2013-12-19T15:23:18Z | - |
dc.date.issued | 2013-12-19 | - |
dc.identifier.issn | kh | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2924 | - |
dc.description | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010 | en_US |
dc.description.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 prop- erty. Taking advantage of this nice structure, we present a decomposition of the SCP into a mixed linear-integer program, and we present a Benders- like algorithm. We end the paper with the computational experience where twenty randomly generated instances are run. | en_US |
dc.language.iso | en | en_US |
dc.subject | Set Covering | en_US |
dc.subject | Benders Decomposition | en_US |
dc.subject | Consecutive Ones Property | en_US |
dc.subject | Consecutive Block Minimisation | en_US |
dc.title | Benders Decomposition Approach to Set Covering Problems Satisfying Almost the Consecutive Ones Property | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Salim Haddadi.pdf | 143,61 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.