scientific article; zbMATH DE number 3850854

zbMATH Open0535.90095MaRDI QIDQ3320152FDOQ3320152

Authors:

Publication date: 1983

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

Recommendations

• scientific article; zbMATH DE number 1163097
• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 4095242
• scientific article; zbMATH DE number 795218
• scientific article; zbMATH DE number 3905859

zbMATH Keywords

parallel algorithmtravelling salesmanlinear assignmentshortest-pathcomputational experiencebottleneck objective functionsolution of a class of network optimization problemsvariable upper bound constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10)

Cited In (2)

• Title not available (Why is that?)
• 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 Q3320152)