Separation of partition inequalities for the (1,2)-survivable network design problem
Year of publication: |
2002
|
---|---|
Authors: | Kerivin, Hervé ; Mahjoub, Ali Ridha |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 30.2002, 4, p. 265-268
|
Saved in:
Saved in favorites
Similar items by person
-
On a resource-constrained scheduling problem with application to distributed systems reconfiguration
Sirdey, Renaud, (2007)
-
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Baïou, Mourad, (2023)
-
Separation of Partition Inequalities
Bai͏̈ou, Mourad, (2000)
- More ...