}
@Article{GILL1989,
-author = {P.E. Gill et al.},
+author = {P. E. Gill et al.},
title = {A pratical anti-cycling procedure for linearly constrained optimization},
journal = {Mathematical Programming},
year = {1989},
@Misc{VOLKOV2010,
author = {V. Volkov},
title = {Better Performance at Lower Occupancy},
-howpublished = {http://www.cs.berkeley.edu/~volkov/},
-year = {2010}
+note = {Presentation at the {GPU} {T}echnology {C}onference 2010 (GTC 2010)},
+howpublished = {http://www.eecs.berkeley.edu/$\sim$volkov},
}
@TechReport{MODEL,
@Misc{NETBLIB,
author = {J. Dongarra and E. Grosse},
-title = {The {NETLIB} Repository},
+title = {The {NETLIB} {R}epository at {UTK} and {ORNL}},
+institution = {The University of Tennessee and Oak Ridge National Lab},
howpublished = {http://www.netlib.org},
-year = {2010}
}
@Misc{APMTECH,
}
@Book{WRIGHT,
-author = {S.J. Wright},
+author = {S. J. Wright},
title = {Primal-dual interior-point methods},
publisher = {SIAM},
year = {1998}
}
@Misc{THOMAD,
-author = {M.E. Thomadakis and J.-C. Liu},
+author = {M. E. Thomadakis and J.-C. Liu},
title = {An efficient steepest-edge simplex algorithm for {SIMD} computers},
year = {1996}
}
@Misc{HALL,
-author = {J.A.J. Hall},
+author = {J. A. J. Hall},
title = {Towards a practical parallelisation of the simplex method},
year = {2007}
}
@Book{HILLIER,
-author = {F.S Hillier and G.J. Lierberman},
+author = {F. S Hillier and G. J. Lierberman},
title = {Introduction to Operations Research},
year = {2010},
edition = {9}
}
@TechReport{DANTZIG80,
-author = {G.B. Dantzig},
+author = {G. B. Dantzig},
title = {Expected number of steps of the simplex method for a linear program with a convexity constraint},
institution = {Stanford {U}niversity},
year = {1980}
author = {X. Meyer},
title = {Etude et implmentation de l'algorithme standard du simplexe sur {GPU}s},
school = {University of {Geneva}},
-year = {2011},
+year = {2011}
+}
+
+@InProceedings{MEYER2011,
+author = {X. Meyer{,} P. Albuquerque and B. Chopard},
+title = {A multi-{GPU} implementation and performance model for the standard simplex method},
+booktitle = {Proc. of the 1st Int'l Symp. and 10th Balkan Conf. on Operational Research, BalcOR},
+year = {2011}
}
@Article{LALAMI11,
-author = {M.E. Lalami{,} D. El-Baz and V. Boyer},
-title = {Multi GPU Implementation of the Simplex Algorithm},
+author = {M. E. Lalami{,} D. El-Baz and V. Boyer},
+title = {Multi-{GPU} Implementation of the Simplex Algorithm},
journal = {IEEE International Conference on High Performance Computing and Communications},
year = {2011},
pages = {179-186}
@Article{JUNG08,
author = {J. H. Jung and D. P. O'Leary},
-title = {Implementing an interior point method for linear programs on a CPU-GPU system},
+title = {Implementing an interior point method for linear programs on a {CPU-GPU} system},
journal = {Electronic Transactions on Numerical Analysis},
year = {2008},
pages = {174-189},
@Article{ELSTER09,
author = {D. G. Spampinato{,} A. C. Elster and T. Natvig},
-title = {Modeling Multi-GPU Systems in Parallel Computing: From Multicores and GPU's to Petascale},
+title = {Modeling Multi-{GPU} Systems in Parallel Computing: From Multicores and {GPU}'s to Petascale},
journal = {Advances in Parallel Computing},
year = {2010},
pages = {562-569},
@book{dantzig1953product,
title={The Product Form for the Inverse in the Simplex Method},
- author={DANTZIG, G.B. and Orchard-Hays, W. and RAND CORP SANTA MONICA CALIF.},
+ author={G. B. Dantzig and W. Orchard-Hays},
+ institution={RAND Corp.},
+ address={Santa Monica, California},
url={http://books.google.ch/books?id=XLuttgAACAAJ},
year={1953},
publisher={Defense Technical Information Center}
@article{Marchand:2002:CPI:772382.772395,
- author = {Marchand, Hugues and Martin, Alexander and Weismantel, Robert and Wolsey, Laurence},
+ author = {Marchand, H. and Martin, A. and Weismantel, R. and Wolsey, L.},
title = {Cutting planes in integer and mixed integer programming},
journal = {Discrete Appl. Math.},
issue_date = {15 November 2002},
}
@PhdThesis{WOLTER06,
-author = {Kati Wolter},
+author = {K. Wolter},
title = {Implementation of cutting plane separators for mixed integer programs},
school = {TU Berlin},
year = {2006}
}
@PhdThesis{ACHTERBERG07,
-author = {Tobias Achterberg},
+author = {T. Achterberg},
title = {Constraint integer programming},
school = {TU Berlin},
year = {2007}
volume={43},
issue={1},
doi={10.1007/BF02025534},
-title={A fast LU update for linear programming},
+title={A fast {LU} update for linear programming},
url={http://dx.doi.org/10.1007/BF02025534},
publisher={Baltzer Science Publishers, Baarn/Kluwer Academic Publishers},
-author={Suhl, LeenaM. and Suhl, UweH.},
+author={L. M. Suhl and U. H. Suhl},
pages={33-47},
language={English}
}
title={Experiments in mixed-integer linear programming},
url={http://dx.doi.org/10.1007/BF01584074},
publisher={Springer-Verlag},
-author={Benichou, M. and Gauthier, J.M. and Girodet, P. and Hentges, G. and Ribiere, G. and Vincent, O.},
+author={M. Benichou et al.},
pages={76-94},
language={English}
}
@article{Achterberg05,
- author = {Achterberg, Tobias and Koch, Thorsten and Martin, Alexander},
+ author = {T. Achterberg{,} T. Koch and A. Martin},
title = {Branching rules revisited},
journal = {Oper. Res. Lett.},
issue_date = {January, 2005},
number = {5},
pages = {736-773}
}
+
+@article {LEMKE54,
+author = {Lemke, C. E.},
+title = {The dual method of solving the linear programming problem},
+journal = {Naval Research Logistics Quarterly},
+volume = {1},
+number = {1},
+publisher = {Wiley Subscription Services, Inc., A Wiley Company},
+issn = {1931-9193},
+url = {http://dx.doi.org/10.1002/nav.3800010107},
+doi = {10.1002/nav.3800010107},
+pages = {36--47},
+year = {1954}
+}
+
+
+@article{BARTELS69,
+ author = {R. H. Bartels and G. H. Golub},
+ title = {The simplex method of linear programming using {LU} decomposition},
+ journal = {Commun. ACM},
+ issue_date = {May 1969},
+ volume = {12},
+ number = {5},
+ month = may,
+ year = {1969},
+ issn = {0001-0782},
+ pages = {266--268},
+ numpages = {3},
+ url = {http://doi.acm.org/10.1145/362946.362974},
+ doi = {10.1145/362946.362974},
+ acmid = {362974},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+ keywords = {LU decomposition, computational stability, linear programming, round-off errors, simplex method}
+}
+
+@article{BRAYTON70,
+ title={Some results on sparse matrices},
+ author={R. K. Brayton{,} F. G. Gustavson and R. A. Willoughby},
+ journal={Mathematics of Computation},
+ volume={24},
+ number={112},
+ pages={937--954},
+ year={1970}
+}
