Lower Bounds for Matroid Optimization Problems with a Linear Constraint.
Ilan Doron AradAriel KulikHadas ShachnaiPublished in: ICALP (2024)
Keyphrases
- linear constraints
- optimization problems
- lower bound
- objective function
- combinatorial optimization
- nonlinear programming
- greedy algorithm
- upper bound
- branch and bound
- evolutionary algorithm
- branch and bound algorithm
- constraint databases
- metaheuristic
- cost function
- optimal solution
- lower and upper bounds
- traveling salesman problem
- linearly constrained
- worst case
- np hard
- submodular functions
- knapsack problem
- convex sets
- lagrangian relaxation
- relational databases
- shape analysis
- mathematical programming
- variational inequalities
- training data
- genetic algorithm