scientific article; zbMATH DE number 3843499

zbMATH Open0531.90069MaRDI QIDQ3313626FDOQ3313626

Authors: V. A. Vasyanin, A. I. Savenkov 

Publication date: 1982

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

Recommendations

• A non improving simplex algorithm for transportation problems
• An algorithm for solving the transportation problem
• scientific article; zbMATH DE number 4095208
• A new algorithm for transportation problem
• scientific article; zbMATH DE number 1283858
• Approximation algorithms for a vehicle routing problem
• Algorithms for the minimax transportation problem
• scientific article; zbMATH DE number 5018401

zbMATH Keywords

transportationroutingefficient algorithmbranch-and-bound methodrational organization of deliveries

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A non improving simplex algorithm for transportation problems
• The analysis and application of transportation-route in the system of goods delivery
• Some transportation problems and techniques for solving them
• Universal routing algorithm for cities and other built-up areas
• A NEW OPTIMAL SEARCH ALGORITHM FOR THE TRANSPORTATION FLEET MAINTENANCE SCHEDULING PROBLEM
• Title not available (Why is that?)

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 Q3313626)