OpenAlex
PricingAboutJobs
Log inGet started
Work

Formulations for the Minimum 2-Connected Dominating Set Problem

HTML

Year: 2013
Type: article
Source: Electronic Notes in Discrete Mathematics
DOI: 10.1016/j.endm.2013.05.120
Authors: Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan
Institution: Universidade Federal do Rio de Janeiro
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: 2-connected graphs, valid inequalities, primal heuristics, branch-and-cut, integer programming formulation, network design

Open Access status: closed
OpenAlex ID: W1999840331
FWCI: 1.532
Cites: 10
Cited by: 11
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security