scientific article; zbMATH DE number 14735

zbMATH Open0737.90069MaRDI QIDQ3977200

G. G. Bolotashvili

Publication date: 25 June 1992

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

zbMATH Keywords

weighted complete graphmaximum acyclic tournament

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A new polynomial-time algorithm for linear programming 👍 👎
• A polynomial algorithm for recognizing the \(\mathcal A\)-order class 👍 👎
• On the computational complexity of the order polynomial 👍 👎
• A polynomial-time algorithm for a class of linear complementarity problems 👍 👎
• Polynomial algorithms for linear programming over the algebraic numbers 👍 👎
• Polynomial size linear programs for problems in \textsc{P} 👍 👎
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs 👍 👎
• Towards a Genuinely Polynomial Algorithm for Linear Programming 👍 👎

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