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

scientific article; zbMATH DE number 176425

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

zbMATH Open0768.65029MaRDI QIDQ4035581FDOQ4035581


Authors: Clovis Perin, Fernando Augusto S. Marins Edit this on Wikidata


Publication date: 18 May 1993



Title of this publication is not available (Why is that?)



Recommendations

  • Algorithms for network piecewise-linear programs: A comparative study
  • scientific article; zbMATH DE number 1195629
  • A Dual Simplex Algorithm for Piecewise-Linear Programming
  • A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
  • Solving Piecewise-Linear Programs: Experiments with a Simplex Approach


zbMATH Keywords

algorithmsratio testlinear constraintsdual simplex algorithmcut-setspiecewise linear network programming


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35)



Cited In (1)

  • Algorithms for network piecewise-linear programs: A comparative study





This page was built for publication:

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

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