Login / Signup
Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity.
Pao-Te Lin
Kuo-Shih Tseng
Published in:
IEEE Robotics Autom. Lett. (2023)
Keyphrases
</>
np complete
neural network
objective function
high dimensional
fourier transform
network topology
optimal solution
dynamic programming
optimization problems
constraint programming
greedy algorithm
combinatorial problems
soft constraints
constraint problems
constraint violations