English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?

MPS-Authors
/persons/resource/persons44307

Dhiflaoui,  Marcel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44464

Funke,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44876

Kwappik,  Carsten
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45446

Seel,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45414

Schömer,  Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45426

Schulte,  Ralph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45713

Weber,  Dennis
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dhiflaoui, M., Funke, S., Kwappik, C., Mehlhorn, K., Seel, M., Schömer, E., et al. (2003). Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers? In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03) (pp. 255-256). New York, USA: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2C74-C
Abstract
There is no abstract available