Solving Combinatorial Problems with Machine Learning Methods

DOI10.1007/978-3-030-16194-1_9MaRDI QIDQ5864853zbMATH OpenOpenAlexFDO

Authors Tiande Guo, Congying Han, Siqi Tang, Man Ding

Publication date 10 June 2022

Published in Nonlinear Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-16194-1_9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited in

(7)

• Learning to select the recombination operator for derivative-free optimization
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Optimal pivot path of the simplex method for linear programming based on reinforcement learning
• Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
• Reinforcement learning for combinatorial optimization: a survey
• High generalization performance structured self-attention model for knapsack problem
• A note on no-free-lunch theorem

This page was built for publication: Solving Combinatorial Problems with Machine Learning Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864853)