OpenAlex
PricingAboutJobs
Log inGet started
Work

Comparing Problem Solving Strategies for NP-hard Optimization Problems

HTML

Year: 2013
Type: article
Source: Fundamenta Informaticae
DOI: 10.3233/fi-2013-822
Authors: Mercedes Hidalgo-Herrero, Pablo Rabanal, Ismael Rodríguez, Fernando Rubio
Institution: Universidad Complutense de Madrid
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: NP-hard optimization, NP-complete problems, problem-solving strategies, combinatorial optimization, computational complexity, exponential-time algorithms

Open Access status: closed
OpenAlex ID: W1523311306
FWCI: 0.613
Cites: 21
Cited by: 44
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security