Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
From MaRDI portal
Publication:4427358
DOI10.1287/ijoc.11.1.15zbMath1034.90528OpenAlexW2117666205MaRDI QIDQ4427358
Publication date: 1999
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.11.1.15
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A primer on the application of neural networks to covering array generation ⋮ Portfolio selection using neural networks ⋮ Increasing the attraction area of the global minimum in the binary optimization problem ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ Codimension-2 parameter space structure of continuous-time recurrent neural networks ⋮ Human resource management and performance: a neural network analysis ⋮ Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information ⋮ Simulation of varying parameter recurrent neural network with application to matrix inversion ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ An accelerated procedure for solving binary optimization problems ⋮ ReLU neural networks of polynomial size for exact maximum flow computation ⋮ Learning optimal solutions via an LSTM-optimization framework ⋮ Heuristics and augmented neural networks for task scheduling with non-identical machines ⋮ On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ CNN‐based ultrafast solver of stiff ODEs and PDEs for enabling realtime Computational Engineering ⋮ A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. ⋮ Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization. ⋮ A neural-tabu search heuristic for the real time vehicle routing problem ⋮ Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization ⋮ Noise removal using hysteretic Hopfield tunnelling network in message transmission systems ⋮ Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows ⋮ Set-to-Sequence Methods in Machine Learning: A Review ⋮ The Shape of a Local Minimum and the Probability of its Detection in Random Search ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ A new Lagrangian net algorithm for solving max-bisection problems ⋮ A neural network approach to multiobjective and multilevel programming problems ⋮ Some comparisons of complexity in dictionary-based and linear computational models ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems ⋮ Transport clustering and routing as a visual meshing process ⋮ Data-driven algorithm selection and tuning in optimization and signal processing ⋮ The voice of optimization ⋮ Flexible working arrangements in context: an empirical investigation through self-organizing maps ⋮ A review of Hopfield neural networks for solving mathematical programming problems ⋮ Neural networks in business: Techniques and applications for the operations researcher ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The impact of energy function structure on solving generalized assignment problem using Hopfield neural network ⋮ A hybrid method for solving stochastic job shop scheduling problems ⋮ Equilibria of Iterative Softmax and Critical Temperatures for Intermittent Search in Self-Organizing Neural Networks
