The minimum weakly connected independent set problem: Polyhedral results and Branch–and–Cut - Université Clermont Auvergne Access content directly
Journal Articles Discrete Optimization Year : 2016
No file

Dates and versions

hal-02042583 , version 1 (20-02-2019)

Identifiers

  • HAL Id : hal-02042583 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More