Certifying and repairing solutions to large LPs how good are LP-solvers?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 255-256

  Dhiflaoui, Marcel ^a   Funke, Stefan ^a   Kwappik, Carsten ^a   Mehlhorn, Kurt ^a   Seel, Michael ^a   Schömer, Elmar ^a   Schulte, Ralph ^a   Weber, Dennis ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; COMPUTER SOFTWARE; CONSTRAINT THEORY; DIGITAL ARITHMETIC; HEURISTIC METHODS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT MATRIX; UPPER BOUND;

LINEAR PROGRAMMING;

EID: 0038754172     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. CPLEX. www.cplex.com.
2. Bernd Gärtner. Exact arithmetic at low cost-a case study in linear programming. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 157-166, San Francisco, California, 25-27 January 1998.
3. Leah Epstein, John Noga, Steve Seiden, Jiřrí Sgall and Gerhard Woeginger. Randomized online scheduling on two uniform machines. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algoritms, pages 317-326, N.Y., January 17-19 1999. ACM-SIAM.
4. Rose, D. J. and Tarjan, R. E. Algorithm aspects of vertex elimination on directed graphs. SIAM J. Appl. Math., 34(1):176-197, 1978.
5. Wiedemann, D. H. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, IT-32(1):54-62, 1986.