linear programming
A mathematical method for optimizing a linear objective function subject to linear equality and inequality constraints. It is used in various AI applications, including resource allocation and scheduling problems.
- Distances for Markov chains from sample streams
- Efficient and Generalizable Mixed-Precision Quantization via Topological Entropy
- Enforcing convex constraints in Graph Neural Networks
- GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
- Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
- Individual Fairness In Strategic Classification