On a primal-proximal heuristic in discrete optimization.
Aris DaniilidisClaude LemaréchalPublished in: Math. Program. (2005)
Keyphrases
- discrete optimization
- combinatorial optimization problems
- optimal solution
- combinatorial optimization
- knapsack problem
- linear program
- tabu search
- graph matching
- linear programming
- simulated annealing
- dynamic programming
- metaheuristic
- objective function
- search strategies
- search algorithm
- computational complexity
- support vector
- mumford shah functional