Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2924
Title: | Benders Decomposition Approach to Set Covering Problems Satisfying Almost the Consecutive Ones Property |
Authors: | Salim Haddadi and Nacira Hamidane |
Keywords: | Set Covering Benders Decomposition Consecutive Ones Property Consecutive Block Minimisation |
Issue Date: | 19-Dec-2013 |
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. |
Description: | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010 |
URI: | http://hdl.handle.net/123456789/2924 |
ISSN: | kh |
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.