OpenAlex
PricingAboutJobs
Log inGet started
Work

Constraint satisfaction problems solved by semidefinite relaxations

HTML

Year: 2008
Type: article
Source: WSEAS Transactions on Computers archive
Authors: Mohamed Ettaouil, Chakir Loqman
Institution: Sidi Mohamed Ben Abdellah University
Language: English

Topic: Advanced Optimization Algorithms Research
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Keywords: constraint satisfaction, semidefinite relaxation, 0-1 quadratic programming, quadratic knapsack problem, branch and bound, lower bounds, upper bounds, feasibility testing, problem reduction

Open Access status: closed
OpenAlex ID: W159266583
FWCI: 0.961
Cites: 22
Cited by: 8
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