Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Design and research of parallel schemes for the Dantzig algorithm

From MaRDI portal
Publication:4899544
Jump to:navigation, search

zbMATH Open1265.68353MaRDI QIDQ4899544FDOQ4899544


Authors: S. D. Pogorilyj, I. V. Bilokon', T. Yu. Protsiv Edit this on Wikidata


Publication date: 8 January 2013





Recommendations

  • scientific article; zbMATH DE number 56471
  • A parallel shortest augmenting path algorithm for the assignment problem
  • scientific article; zbMATH DE number 1222607
  • Parallel Algorithms for Dynamic Shortest Path Problems
  • A parallel shortest path algorithm


zbMATH Keywords

parallel algorithmalgorithmic algebraDantzig algorithm


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)



Cited In (5)

  • Parallel programming on top of DSM system. An experimental study
  • Parallel realization and analysis of SMV and DAC algorithm
  • \(D\&C\) method for solving large problems in fixed size processor array
  • A systematic design of a parallel program for Dirichlet convolution
  • Research and development of Johnson's algorithm parallel schemes in GPGPU technology





This page was built for publication: Design and research of parallel schemes for the Dantzig algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4899544&oldid=19285024"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 05:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki