The minimum weakly connected independent set problem: Polyhedral results and Branch–and–Cut

Complete list of metadatas

https://hal.uca.fr/hal-02042583
Contributor : Fatiha Bendali <>
Submitted on : Wednesday, February 20, 2019 - 2:45:22 PM
Last modification on : Monday, January 20, 2020 - 12:14:06 PM

Identifiers

  • HAL Id : hal-02042583, version 1

Citation

Fatiha Bendali, Jean Mailfert, Djelloul Mameri. The minimum weakly connected independent set problem: Polyhedral results and Branch–and–Cut. Discrete Optimization, Elsevier, 2016, 22, pp.87-110. ⟨hal-02042583⟩

Share

Metrics

Record views

55