Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem
R Zamani, SK Lau - European Journal of Operational Research, 2010 - Elsevier
This paper presents an effective procedure that finds lower bounds for the travelling
salesman problem based on the 1-tree using a learning-based Lagrangian relaxation …
salesman problem based on the 1-tree using a learning-based Lagrangian relaxation …
Graph Convolutional Branch and Bound
This article demonstrates the effectiveness of employing a deep learning model in an
optimization pipeline. Specifically, in a generic exact algorithm for a NP problem, multiple …
optimization pipeline. Specifically, in a generic exact algorithm for a NP problem, multiple …
Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization
G Serpen - Mathematics and computers in simulation, 2004 - Elsevier
A simulation methodology, which trades space complexity with time complexity, to create the
Hopfield neural network weight matrix, the costliest data structure for simulation of Hopfield …
Hopfield neural network weight matrix, the costliest data structure for simulation of Hopfield …
[图书][B] Fuzzy greedy search in combinatorial optimisation
K Sheibani - 2008 - books.google.com
In recent years, there has been a growth of interest in the development of systematic search
methods for solving problems in operational research and artificial intelligence. This …
methods for solving problems in operational research and artificial intelligence. This …
The Simultaneous Recurrent Neural Network for Addressing the Scaling Problem in Static Optimization
G Serpen, A Patwardhan, J Geib - International Journal of Neural …, 2001 - World Scientific
A trainable recurrent neural network, Simultaneous Recurrent Neural network, is proposed
to address the scaling problem faced by neural network algorithms in static optimization. The …
to address the scaling problem faced by neural network algorithms in static optimization. The …
A note on relatives to the Held and Karp 1-tree problem
A Westerlund, M Göthe-Lundgren, T Larsson - Operations research letters, 2006 - Elsevier
We study a class of graph problems which includes as special cases the Held and Karp 1-
tree problem, and the minimum spanning tree problem with one degree constraint studied …
tree problem, and the minimum spanning tree problem with one degree constraint studied …
[PDF][PDF] THÈSE UNIQUE
FHB de Yamoussoukro - 2021 - cea-valopro.inphb.ci
Résumé Les jeux éducatifs numériques (JEN) sont des ressources pédagogiques qui
peuvent améliorer la qualité de formation dans de nombreux contextes éducatifs et à tous …
peuvent améliorer la qualité de formation dans de nombreux contextes éducatifs et à tous …
Alternative leistungselektronische Schaltungskonzepte im PKW-Innenraum
DIS Diesner - 2007 - tud.qucosa.de
Abstract (DE) Elektronische und elektrische Systeme stellen seit einigen Jahren einen
zunehmenden Anteil an den Gesamtproduktionskosten von Personenkraftfahrzeugen. Laut …
zunehmenden Anteil an den Gesamtproduktionskosten von Personenkraftfahrzeugen. Laut …
[PDF][PDF] Adaptacyjny algorytm optymalizacji stadnej cząsteczek dla dynamicznego problemu komiwojażera
R Skinderowicz - researchgate.net
Problem komiwojażera (TSP) został zdefiniowany w 1930 roku i jest jednym z najlepiej
zbadanych problemów optymalizacji dyskretnej. Pod względem klasy złożoności …
zbadanych problemów optymalizacji dyskretnej. Pod względem klasy złożoności …
Adaptive Particle Swarm Optimization Algorithm for the Dynamic Traveling Salesman Problem
ŁL Strąk - 2018 - opus.us.edu.pl
Problem komiwojażera (TSP) został zdefiniowany w 1930 roku i jest jednym z najlepiej
zbadanych problemów optymalizacji dyskretnej. Pod względem klasy złożoności …
zbadanych problemów optymalizacji dyskretnej. Pod względem klasy złożoności …