The Simplex Algorithm Is NP-Mighty (Q4629975): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5363040
 
aliases / en / 0aliases / en / 0
 
The Simplex Algorithm is NP-mighty
description / endescription / en
 
scientific article; zbMATH DE number 6786356
Property / title
 
The Simplex Algorithm is NP-mighty (English)
Property / title: The Simplex Algorithm is NP-mighty (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1371.90081 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611973730.59 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms / rank
 
Normal rank
Property / publication date
 
5 October 2017
Timestamp+2017-10-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 October 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6786356 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1935571660 / rank
 
Normal rank

Latest revision as of 10:19, 6 May 2024

scientific article; zbMATH DE number 6786356
  • The Simplex Algorithm is NP-mighty
Language Label Description Also known as
English
The Simplex Algorithm Is NP-Mighty
scientific article; zbMATH DE number 6786356
  • The Simplex Algorithm is NP-mighty

Statements

The Simplex Algorithm Is NP-Mighty (English)
0 references
The Simplex Algorithm is NP-mighty (English)
0 references
0 references
0 references
0 references
0 references
0 references
28 March 2019
0 references
5 October 2017
0 references
0 references
0 references
0 references
0 references
0 references
0 references
NP-mightiness
0 references
simplex algorithm
0 references
earliest arrival flows
0 references
network simplex
0 references
successive shortest paths
0 references
0 references
0 references
0 references
0 references