Fast and Accurate Bounds on Linear Programs-Reference-Cited by-同舟云学术

Fast and Accurate Bounds on Linear Programs

Published:2009 Issue: Volume: Page:40-50
ISSN:0302-9743
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Althaus Ernst,Dumitriu Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02011-7_6

Reference16 articles.

1. Devulder, S., Lambert, J.L.: A comparative study between linear programming validation (LPV) and other verification methods. In: Automated Software Engineering (ASE), pp. 299–302 (1999)

2. Brinkmann, R., Drechsler, R.: RTL-Datapath verification using integer linear programming. In: Design Automation Conference (ASP-DAC), pp. 741–746. IEEE, Los Alamitos (2002)

3. Lecture Notes in Computer Science;S. Dellacherie,1999

4. Dhiflaoui, M., Funke, S., Kwappik, C., Mehlhorn, K., Seel, M., Schömer, E., Schulte, R., Weber, D.: Certifying and repairing solutions to large LPs how good are LP-solvers? In: Symposium of Discrete Algorithms (SODA), pp. 255–256 (2003)

5. Koch, T.: The final NETLIB-LP results. Oper. Res. Lett. 32(2), 138–142 (2004)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative Refinement for Linear Programming;INFORMS Journal on Computing;2016-07

2. A hybrid branch-and-bound approach for exact rational mixed-integer programming;Mathematical Programming Computation;2013-06-30

3. Valid Linear Programming Bounds for Exact Mixed-Integer Programming;INFORMS Journal on Computing;2013-05

4. Certifying feasibility and objective value of linear programs;Operations Research Letters;2012-07

5. Superposition Modulo Linear Arithmetic SUP(LA);Frontiers of Combining Systems;2009