Doubly constrained network for combinatorial optimization

DOI10.1016/S0925-2312(01)00343-5MaRDI QIDQ5958007zbMATH OpenFDO

Authors Shin Ishii, Masa-aki Sato

Publication date 13 March 2002

Published in Neurocomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-2312(01)00343-5

zbMATH Keywords

combinatorial optimizationdeterministic annealingtraveling salesman problems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Neural network methods in combinatorial optimization
• scientific article; zbMATH DE number 1302186
• scientific article; zbMATH DE number 1304093
• Dual-mode dynamics neural network for combinatorial optimization
• Publication:3481499

Cited in

(9)

• Dual-mode dynamics neural network for combinatorial optimization
• Dual mean field annealing scheme for binary optimization under linear constraints
• A Lagrangian propagator for artificial neural networks in constraint programming
• Combinatorial optimization by dynamic contraction
• scientific article; zbMATH DE number 2177315 (Why is no real title available?)
• Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
• Analysis of Constrained Optimization Variants of the Map-Seeking Circuit Algorithm
• A survey for the quadratic assignment problem
• Backbone analysis and algorithm design for the quadratic assignment problem

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: Doubly constrained network for combinatorial optimization

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