[ Performance World Home | Board | Tools | PerformanceLib | Links | GamsWorld group | Search | Contact ]

LINLib Bibliography

• Andrew Boyd, E, Fenchel Cutting Planes for Integer Programs. to appear in Operations Research
• Andrew Boyd, E, Generating Fenchel Cutting Planes for Knapsack Polyhedra. to appear in the SIAM Journal on Optimization
• Andrew Boyd, E, Solving Integer Programs with Enumeration Cutting Planes.
• Barutt, J, and Hull, T, Airline Crew Scheduling: Supercomputers and Algorithms. SIAM News 23, 6 (1990).
• Bienstock, D, Computational Experience with an Effective Heuristic for Some Capacity Expansion Problems in the Local Access Networks.
• Binous, H, Chemical Engineering Application Models. (Contributed models)
• Bixby, R, Ceria, S, McZeal C M, and Savelsbergh, M W P, An Updated Mixed Integer Programming Library: MIPLIB 3.0. Optima 58 (1998), 12-15.
• Bouvier, B, and Messoumian, G, Programmes Lineaires en Variables Bivalentes--Algorithm de Balas. Tech. rep., Universite de Grenoble, 1965.
• Carolan, W J, Hill, J E, Kennington J L, Niemi, S, and Wichmann, S J, An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications. Operations Research 38, 2 (1990), 240-248.
• Cook, W, Rutherford, T, Scarf, H E, and Sallcoss, D, An Implementation of the Generalized Basis Reduction Algorithme for Integer Programming. Tech. rep., DIMACS, 1980.
• Cook, W, Integer Programming Solutions for Capacity Expansion of the Local Access Network. Tech. rep., Bellcore Technical Memorandum, 1991.
• Crowder, H, Johnson, E L, and Padberg, M, Solving Large-Scale Zero-One Linear Programming Problems. Operations Research 31, 5 (1983).
• Eckstein, J, Parallel Branch-and-Bound Methods for Mixed-Integer Programming on the CM-5. SIAM Journal on Optimization 4, 4 (1994), 794-814.
• Eckstein, J, Parallel Branch-and-Bound Methods for Mixed Integer Programming. SIAM News 27, 1 (1994), 1-1215.
• Edgar, T F, Himmelblau, D M, and Lasdon, L S, Optimization of Chemical Processes. McGraw Hill, Boston, 2001.
• Gailly, B, and Wolsey, L A, Capacity Expansion of the Local Access Network.
• GAMS Development, GAMS Development Client Models.
• Gottlieb, J, and Paulmann, L, Genetic Algorithms for the Fixed Charge Transportation Problem. Proceedings of the 5th IEEE International Conference on Evolutionary Computation, Anchorage, Alaska (1998), 330-335.
• Hoffman, K L, and Padberg, M, Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut. ORSA Journal on Computing 3, 2 (1991).
• Johnson, E L, and Suhl, U H, Experiments in Integer Programming. Discrete Appl. Math. 2 (1980), 39-55.
• Lemke, C, and Spielberg, K, Direct Search Zero-One nd Mixed Integer Programming. Oper. Res. 15 (1967), 892-914.
• MIPLIB 3.0 Library, online at http://www.caam.rice.edu/~bixby/miplib/miplib.html.
• Miscellaneous LP Models, Hungarian Academy of Sciences OR Lab: online at ftp.sztaki.hu/oplab.
• Mittelmann H. - LP Models, Miscellaneous LP models collected by Hans D. Mittelmann: online at ftp://plato.la.asu.edu/pub/lptestset/.
• Mittelmann H. - MIP Models, Miscellaneous MIP models collected by Hans D. Mittelmann: online at ftp://plato.la.asu.edu/pub/milp/.
• Mittelmann, H, Miscellaneous MIQCP models by Hans D. Mittelmann: online at ftp://plato.la.asu.edu/pub/miqp/.
• MOSEK ApS, MOSEK Consulting Client Models.
• Nemhauser, G L, and Trick, M A, Scheduling a Major College Basketball Conference. Operations Research 46 (1998), 1-8.
• NEOS MIP Benchmark, online at ftp://ftp.mcs.anl.gov/neos/mip-bench/.
• NETLIB Infeasible LP Library, online at http://www.netlib.org/lp/infeas.
• NETLIB LP Repository, online at http://www.netlib.org/lp/data.
• Problematic LP Models, Hungarian Academy of Sciences OR Lab: online at ftp.sztaki.hu/oplab.
• Senju, S, and Toyoda, Y, An Approach to Linear Programming wht 0-1 Variables. Management Science 15 (1968), b196-b207.
• Stochastic LP Models, Hungarian Academy of Sciences OR Lab: online at ftp.sztaki.hu/oplab.
• Sun, M, Aronson, J E, McKeown, P G, and Drinka, D, A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research 106 (1998), 441-456.
• Van Roy, T J, and Wolsey, L A, Solving Mixed Integer Programming Problems Using Automatic Reformulation. Oper. Res. 35, 1 (1987), 45-47.