Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath1198.90010MaRDI QIDQ3585561

Achim Koberstein

Publication date: 20 August 2010

Full work available at URL: http://d-nb.info/978580478

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)


Related Items (8)

Parallel search paths for the simplex algorithm ⋮ Computing in Operations Research Using Julia ⋮ Parallel distributed-memory simplex for large-scale stochastic LP problems ⋮ Permutations in the Factorization of Simplex Bases ⋮ A primal heuristic for optimizing the topology of gas networks based on dual information ⋮ Gauss–Newton Methods for Robust Parameter Estimation ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation


Uses Software

  • SoPlex
  • CPLEX
  • Dsor



This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3585561&oldid=30841595"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 13 March 2024, at 15:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki