OpenAlex
PricingAboutJobs
Log inGet started
Work

Improved dual network simplex

HTML

Year: 1990
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/320176.320222
Authors: Serge Plotkin, Éva Tardos
Institutions: Stanford University, Cornell University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: network simplex method, dual simplex method, network flow algorithms, linear programming, computational complexity

Open Access status: closed
OpenAlex ID: W2000830753
FWCI: 0.957
Cites: 6
Cited by: 40
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security