scientific article

zbMATH Open0565.90040MaRDI QIDQ3680603

Author name not available (Why is that?)

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximate solutionnonlinear combinatorial optimizationhierarchical routing of telephone networks

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (1)

A new approach to on-demand loop-free routing in networks using sequence numbers

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Fast approximation algorithms for routing problems with hop-wise constraints 👍 👎
• An approximation algorithm for the general routing problem 👍 👎
• A parallel optimal routing algorithm 👍 👎
• Sequential search and its application to vehicle-routing problems 👍 👎
• Sequencial Routing Optimization for Circuit Switched Networks 👍 👎
• Optimal routing to two parallel heterogeneous servers with resequencing 👍 👎
• An algorithm for sub-optimal routeing in series-parallel queueing networks 👍 👎

This page was built for publication:

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