ASCEND
BY NTHRYS

NTHRYS › PhD Assistance › Discrete Mathematics

Discrete Mathematics

Field
▾
Category
▾

Discrete Mathematics

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Combinatorial Optimization and Integer Programming

Development of efficient algorithms and bounds for solving NP-hard optimization problems on discrete structures using integer and linear programming.

Approximation Hardness at the Polynomial-Exponential Boundary
Submodular Optimization Beyond Greedy Barriers
Integer Programming Reformulations via Symmetry Breaking
Quantum-Inspired Classical Algorithms for NP-Hard Problems
Sparse Recovery and Combinatorial Phase Transitions
Cutting Planes in High-Dimensional Polytope Geometry
Machine Learning for Branch-and-Bound Exploration
Matroid Intersection and Weighted Constraint Synthesis
Continuous Relaxations of Discrete Structure Problems
Stochastic Combinatorial Optimization Under Uncertainty

All Discrete Mathematics PhD categories