Coin-Or: An Open-Source Library for Optimization

Optimization models and algorithms are important tools for modeling and solving a wide variety of problems in finance and economics.

[1]  Katya Scheinberg,et al.  Recent progress in unconstrained nonlinear optimization without derivatives , 1997, Math. Program..

[2]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[3]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[5]  Abilio Lucena,et al.  Branch and cut algorithms , 1996 .

[6]  Samer Takriti,et al.  Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem , 2000, Oper. Res..

[7]  Jonathan Eckstein,et al.  Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 , 1994, SIAM J. Optim..

[8]  Leslie E. Trotter,et al.  Branch, Cut, and Price: Sequential and Parallel , 2000, Computational Combinatorial Optimization.

[9]  K. Derviş,et al.  General equilibrium models for development policy , 1982 .

[10]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[11]  Matthew J. Saltzman,et al.  Statistical Analysis of Computational Tests of Algorithms and Heuristics , 2000, INFORMS J. Comput..

[12]  Fangruo Chen,et al.  A Staggered Ordering Policy for One-Warehouse, Multiretailer Systems , 2000, Oper. Res..

[13]  Stavros A. Zenios,et al.  Some financial optimization models: I Risk management , 1993 .

[14]  Dimitris Bertsimas,et al.  Portfolio Construction Through Mixed-Integer Programming at Grantham, Mayo, Van Otterloo and Company , 1999, Interfaces.

[15]  J. Francois,et al.  Applied Methods for Trade Policy Analysis: List of Contributors , 1997 .

[16]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[17]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[18]  Jack Dongarra,et al.  A User''s Guide to PVM Parallel Virtual Machine , 1991 .

[19]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[20]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[21]  Nicos Christofides,et al.  Capital Budgeting Under Uncertainty - An Integrated Approach Using Contingent Claims Analysis and Integer Programming , 2001, Oper. Res..

[22]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[23]  George L. Nemhauser,et al.  Experiments with parallel branch-and-bound algorithms for the set covering problem , 1993, Oper. Res. Lett..

[24]  Eric S. Raymond,et al.  The cathedral and the bazaar , 1998, First Monday.

[25]  Sherman Robinson,et al.  Applied Methods for Trade Policy Analysis: Simple General Equilibrium Modeling , 1997 .

[26]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[27]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[28]  A. Janvry,et al.  Quantitative development policy analysis , 1994 .

[29]  B. Gillett,et al.  A parallel integer linear programming algorithm , 1988 .

[30]  Vipin Kumar,et al.  Parallel search algorithms for discrete optimization problems , 1993, System Modelling and Optimization.

[31]  Jonathan Eckstein,et al.  How Much Communication Does Parallel Branch and Bound Need? , 1997, INFORMS J. Comput..

[32]  Eric S. Raymond,et al.  The Cathedral and the Bazaar , 2000 .

[33]  Katya Scheinberg,et al.  On the convergence of derivative-free methods for unconstrained optimization , 1997 .

[34]  Matthew J. Saltzman,et al.  Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications , 2002, International Conference on Computational Science.

[35]  Michael Jünger,et al.  Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.

[36]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..