grant
CAREER: Analytic and Algebraic Methods in Approximating Constraint Satisfaction Problems and Their Applications
Organization University of California-RiversideLocation RIVERSIDE, United StatesPosted 1 Jul 2025Deadline 30 Jun 2030
NSFUS FederalResearch GrantScience FoundationCA
Description preview
Many problems in industries such as manufacturing, scheduling, and chip design require solving discrete optimization problems over a finite but large set of feasible solutions. This field of optimization relies on mathematical disciplines such as graph theory, algebra, and topology to design efficient algorithms. However, for many of these…
🔒
Start 7-day free trial — $29.99/mo →Full details available on the Agency plan
Unlock the complete grant description, eligibility criteria, contract value, evaluation details and apply link — plus alerts, pipeline tracking, and CSV export.
Agency Plan
7-day free trialUnlock procurement & grants
Upgrade to access active tenders from World Bank, UNDP, ADB and more — with email alerts and pipeline tracking.
$29.99 / month
- 🔔Email alerts for new matching tenders
- 🗂️Track tenders in your pipeline
- 💰Filter by contract value
- 📥Export results to CSV
- 📌Save searches with one click