View of SOLVING NP-HARD OPTIMIZATION PROBLEMS: A COMPARISON OF CLASSICAL APPROXIMATION ALGORITHMS AND MODERN METAHEURISTIC AND LEARNING-BASED METHODS

Return to Issue Details SOLVING NP-HARD OPTIMIZATION PROBLEMS: A COMPARISON OF CLASSICAL APPROXIMATION ALGORITHMS AND MODERN METAHEURISTIC AND LEARNING-BASED METHODS Download Download PDF