Heuristic procedure neural networks for the CMST problem

DOI10.1016/S0305-0548(99)00145-8MaRDI QIDQ1579025zbMATH OpenOpenAlexFDO

Authors Hasan Pirkul, Raymond A. Patterson

Publication date 12 March 2002

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(99)00145-8

zbMATH Keywords

optimizationneural networktopological network design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Heuristics for the multi-level capacitated minimum spanning tree problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• An efficient branch and bound algorithm for the CMST problem
• The multilevel capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 1488100

Cites work

• scientific article; zbMATH DE number 1488100 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• A New Class of Algorithms for Multipoint Network Optimization
• A hybrid neural approach to combinatorial optimization
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A multicommodity network flow application for the capacitated minimal spanning tree problem
• A neural network model for scheduling problems
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Dynamic programming based heuristics for the topological design of local access networks
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• Massively parallel analog tabu search using neural networks applied to simple plant location problems
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• The complexity of the capacitated tree problem
• Topological design of centralized computer networks—formulations and algorithms
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• ``Neural computation of decisions in optimization problems

Cited in

(2)

• Neural network-based heuristic algorithms for hypergraph coloring problems with applications.
• Neural networks in business: Techniques and applications for the operations researcher

This page was built for publication: Heuristic procedure neural networks for the CMST problem

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