Science Explorer Back to mapMap

Constraint Satisfaction and Optimization

Constraint Satisfaction and Optimization is a research topic within Computer Networks and Communications. Science Explorer counts 16k research works in it since 1950. 10.1% of them reached the world's top 10% most cited for their field and year.

This cluster of papers focuses on distributed constraint optimization problems and algorithms, including topics such as random satisfiability, local search, spatial reasoning, algorithm selection, phase transitions, soft constraints, temporal reasoning, and graph coloring.

  • Constraint Optimization
  • Distributed Algorithms
  • Random Satisfiability
  • Local Search
  • Spatial Reasoning
  • Algorithm Selection
  • Phase Transitions
  • Soft Constraints
  • Temporal Reasoning
  • Graph Coloring
Research works
16k
fractional, since 1950
In the world top 10%
1.7k
per year above
Top-10% rate
10.1%
share of its works in the world top 10%
Growth, 2018-21 → 2022-25
+5%
the tick is no change
Largest producer
China
26% of the 10 largest, 2022-now
Constraint Satisfaction and Optimization
Drawing this view