Heuristic procedure neural networks for the CMST problem (Q1579025): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The complexity of the capacitated tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multicommodity network flow application for the capacitated minimal spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Algorithms for Multipoint Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics with Constant Error Guarantees for the Design of Tree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based heuristics for the topological design of local access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively parallel analog tabu search using neural networks applied to simple plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network model for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid neural approach to combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(99)00145-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084946517 / rank
 
Normal rank

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Heuristic procedure neural networks for the CMST problem
scientific article

    Statements

    Heuristic procedure neural networks for the CMST problem (English)
    0 references
    0 references
    0 references
    12 March 2002
    0 references
    optimization
    0 references
    neural network
    0 references
    topological network design
    0 references
    0 references
    0 references

    Identifiers