Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm
Authors
Keywords
Linear programming, Simplex algorithm, Number of iterations, Basic feasible solutions, NP-hardness
Journal
Optimization Letters
Volume 12, Issue 5, Pages 933-943
Publisher
Springer Nature
Online
2018-05-18
DOI
10.1007/s11590-018-1276-4
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.