The Wingulf Package
暂无分享,去创建一个
[1] R. Malhotra,et al. Multi-criteria integer linear fractional programming problem , 1995 .
[2] William J. Cook,et al. Combinatorial optimization , 1997 .
[3] Tibor Illés,et al. The finite criss-cross method for hyperbolic programming , 1996, Eur. J. Oper. Res..
[4] Moshe Sniedovich. Fractional programming revisited , 1988 .
[5] John E. Beasley. Advances in Linear and Integer Programming , 1996 .
[6] Jaap Spronk,et al. Financial planning with fractional goals , 1995 .
[7] Gabriel R. Bitran,et al. Duality and Sensitivity Analysis for Fractional Programs , 1976, Oper. Res..
[8] C. R. Bector,et al. Duality in Multiobjective Fractional Programming , 1990 .
[9] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[10] Youcef Saad,et al. A Basic Tool Kit for Sparse Matrix Computations , 1990 .
[11] J. D. Vinso,et al. Capital Structure and the Financing of the Multinational Corporation: A Fractional Multiobjective Approach , 1982, Journal of Financial and Quantitative Analysis.
[12] M. C. Puri,et al. Ranking in integer linear fractional programming problems , 1990, ZOR Methods Model. Oper. Res..
[13] R. Fletcher,et al. A stable algorithm for updating triangular factors under a rank one change , 1985 .
[14] R. J. Dakin,et al. A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..
[15] Siegfried Schaible,et al. Duality in Fractional Programming: A Unified Approach , 1976, Oper. Res..
[16] Hamdy A. Taha. CHAPTER 2 – Linear Programming , 1975 .
[17] Roland W. Freund,et al. An interior-point method for fractional programs with convex constraints , 1994, Math. Program..
[18] Maiko Shigeno,et al. An Algorithm for Fractional Assignment Problems , 1995, Discret. Appl. Math..
[19] John A. Tomlin,et al. Updated triangular factors of the basis to maintain sparsity in the product form simplex method , 1972, Math. Program..
[20] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[21] Derek Atkins,et al. Multicriteria Programming for Financial Planning , 1979 .
[22] T. Liebling,et al. On the number of iterations of the simplex method. , 1972 .
[23] Kanti Swarup,et al. On duality in linear fractional functionals programming , 1972, Z. Oper. Research.
[24] Gene H. Golub,et al. Matrix computations , 1983 .
[25] K. Swarup. LINEAR FRACTIONAL PROGRAMMING , 1965 .
[26] J. B. G. Frenk,et al. A new algorithm for generalized fractional programs , 1996, Math. Program..
[27] I. Duff. A survey of sparse matrix research , 1977, Proceedings of the IEEE.
[28] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .
[29] J. Neumann. A Model of General Economic Equilibrium , 1945 .
[30] Celso C. Ribeiro,et al. Modelling location and sizing of offshore platforms , 1994 .
[31] S. Chandra,et al. A note on integer linear fractional programming , 1980 .
[32] Kanti Swarup,et al. Duality in fractional programming , 1968, Unternehmensforschung.
[33] K. Swarup. Some Aspects of Duality for Linear Fractional Functionals Programming , 1967 .
[34] John K. Reid,et al. A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases , 1982, Math. Program..
[35] A. Cambini,et al. Generalized convexity and fractional programming with economic applications : proceedings of the International Workshop on "Generalized Concavity, Fractional Programming, and Economic Applications" held at the University of Pisa, Italy, May 30-June 1, 1988 , 1990 .
[36] Hamdy A. Taha,et al. Integer Programming: Theory, Applications, and Computations , 1975 .
[37] C. Seshan. On duality in linear fractional programming , 1980 .
[38] Michael A. Saunders,et al. A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING , 1976 .
[39] Jean-Pierre Crouzeix,et al. Convergence of a Dinkelbach-type algorithm in generalized fractional programming , 1987, Z. Oper. Research.
[40] C. R. Bector. Duality in fractional and indefinite programming , 1968 .
[41] J. Kornbluth,et al. A Note on the Economic Interpretation of the Dual Variables in Linear Fractional Programming , 1972 .
[42] C. R. Bector. Duality in nonlinear fractional programming , 1973, Z. Oper. Research.
[43] Y. Almogy,et al. A Class of Fractional Programming Problems , 1971, Oper. Res..
[44] Gue Myung Lee,et al. Duality for multiobjective fractional programming involving n-set functions sup * , 1994 .
[45] William H. Press,et al. Numerical recipes in C , 2002 .
[46] Klaus Ritter,et al. A Parametric Method for Solving Certain Nonconcave Maximization Problems , 1967, J. Comput. Syst. Sci..
[47] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.
[48] S. S. Chadha. A Dual Fractional Program , 1971 .
[49] H. Mine,et al. A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS , 1976 .
[50] Hiroshi Konno,et al. Minimizing and maximizing the product of linear fractional functions , 1992 .
[51] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[52] T. Terlaky. A convergent criss-cross method , 1985 .
[53] S. Schaible,et al. An algorithm for generalized fractional programs , 1985 .
[54] F. Lootsma. Multi-Criteria Decision Analysis via Ratio and Difference Judgement , 1999 .
[55] Tamás Terlaky,et al. Criss-cross methods: A fresh view on pivot algorithms , 1997, Math. Program..
[56] Jacques A. Ferland,et al. Algorithms for generalized fractional programming , 1991, Math. Program..
[57] Roger Fletcher,et al. Stable modification of explicitLU factors for simplex updates , 1984, Math. Program..
[58] Jsh Kornbluth,et al. A survey of goal programming , 1973 .
[59] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[60] Ireneusz Nykowski,et al. A compromise procedure for the multiple objective linear fractional programming problem , 1985 .
[61] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[62] Finn E. Kydland. Duality in fractional programming , 1972 .
[63] Michael T. Heath,et al. Scientific Computing , 2018 .
[64] W. Greub. Linear Algebra , 1981 .
[65] Sei-ichiro Kamata,et al. A New Algorithm for , 1999 .
[66] J. Reid,et al. On the Automatic Scaling of Matrices for Gaussian Elimination , 1972 .
[67] E. Choo,et al. Bicriteria linear fractional programming , 1982 .
[68] P. Gill,et al. Maintaining LU factors of a general sparse matrix , 1987 .
[69] Robert R. Ross,et al. Research introduction , 1974 .
[70] David J. Pannell,et al. GULF: A general, user-friendly linear and linear-fractional programming package , 1993 .
[71] Sergio Pissanetzky,et al. Sparse Matrix Technology , 1984 .
[72] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[73] M. C. Puri,et al. Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function , 1977 .
[74] Michael Reisch,et al. An Introductory Survey , 2003 .
[75] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .
[76] C. R. Bector,et al. Duality for Multiobjective Fractional Programming Involving n-Set Functions , 1994 .
[77] C. Scott,et al. Fractional programming duality via geometric programming duality , 1980, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[78] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[79] Kenneth E. Rosing. Considering offshore production platforms , 1994 .
[80] M. Uschold,et al. Methods and applications , 1953 .
[81] D. Granot,et al. On Integer and Mixed Integer Fractional Programming Problems , 1977 .
[82] Robert G. Bland,et al. New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..
[83] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[84] Ramaswamy Chandrasekaran,et al. Minimal ratio spanning trees , 1977, Networks.
[85] Ralph E. Steuer,et al. Multiple Objective Linear Fractional Programming , 1981 .
[86] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[87] Toshihide Ibaraki,et al. Fractional knapsack problems , 1977, Math. Program..
[88] R. N. Mukherjee. Generalized convex duality for multiobjective fractional programs , 1991 .
[89] R. Tiwari,et al. Fuzzy approaches for multiple criteria linear fractional optimization: a comment , 1993 .
[90] B. Craven,et al. The Dual of a Fractional Linear Program , 1973 .
[91] Susan W. Palocsay,et al. Optimizing the sum of linear fractional functions , 1992 .
[92] Siegfried Schaible,et al. Duality in generalized fractional programming via Farkas' lemma , 1983 .
[93] J. B. Dent,et al. Farm Planning with Linear Programming: Concept and Practice , 1986 .
[94] S. Aggarwal. Analyses of the solution to a linear fractional functionals programming , 1970 .
[95] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[96] J. B. Hardaker. Farm planning by computer. , 1972 .
[97] Jaromir Abrham,et al. Comparison of duality models in fractional linear programming , 1977, Math. Methods Oper. Res..
[98] A. Cambini,et al. On Maximizing a Sum of Ratios , 1989 .
[99] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[100] Erik B. Bajalinov. On an approach to the modelling of problems connected with conflicting economic interests , 1999, Eur. J. Oper. Res..
[101] Arkadi Nemirovski. The long-step method of analytic centers for fractional problems , 1997, Math. Program..
[102] Pierre Hansen,et al. Hyperbolic 0–1 programming and query optimization in information retrieval , 1991, Math. Program..
[103] Thoddi C. T. Kotiah,et al. On Two-Server Poisson Queues with Two Types of Customers , 1973, Oper. Res..
[104] David I. Steinberg,et al. Occurrences of cycling and other phenomena arising in a class of linear programming models , 1977, CACM.
[105] A. M. Mármol,et al. The tolerance approach in multiobjective linear fractional programming , 1997 .
[106] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[107] A. I. Barros. Discrete and Fractional Programming Techniques for Location Models , 1998 .
[108] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[109] O. Saad. An Algorithm for solving the Integer Linear Fractional Programs , 1993 .
[110] Robert D. Skeel,et al. Scaling for Numerical Stability in Gaussian Elimination , 1979, JACM.
[111] Uwe H. Suhl,et al. Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases , 1990, INFORMS J. Comput..
[112] R. Fletcher. Practical Methods of Optimization , 1988 .
[113] P. Robillard. (0, 1) hyperbolic programming problems , 1971 .
[114] G. Nemhauser,et al. Integer Programming , 2020 .
[115] S. Schaible. Fractional Programming: Transformations, Duality and Algorithmic Aspects. , 1973 .
[116] Yurii Nesterov,et al. An interior-point method for generalized linear-fractional programming , 1995, Math. Program..
[117] S. Pissanetzky. Sparse Matrix Algebra , 1984 .
[118] C Tofallis,et al. Fractional Programming: Theory, Methods and Applications , 1997, J. Oper. Res. Soc..
[119] Celso C. Ribeiro,et al. Location and sizing of offshore platforms for oil exploration , 1992 .
[120] J. Gondzio. Stable algorithm for updating dense LU factorization after row or column exchange and row and column addition or deletion , 1992 .
[121] Shuzhong Zhang,et al. Pivot rules for linear programming: A survey on recent theoretical developments , 1993, Ann. Oper. Res..
[122] Philip E. Gill,et al. Numerical Linear Algebra and Optimization , 1991 .
[123] Jacques A. Ferland,et al. Duality in generalized linear fractional programming , 1984, Math. Program..
[124] A. R. G. Heesterman,et al. Matrices and Simplex Algorithms , 1982, Springer Netherlands.
[125] Milind Dawande,et al. Combining and Strengthening Gomory Cuts , 1995, IPCO.
[126] H. P. Williams,et al. Model Building in Mathematical Programming , 1979 .
[127] S. Chandra,et al. An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs , 1979 .
[128] S. Schaible. Fractional programming: Applications and algorithms , 1981 .
[129] J. Hirche. Optimizing of sums and products of linear fractional functions under linear constraints , 1996 .
[130] M. K. Luhandjula. Fuzzy approaches for multiple objective linear fractional optimization , 1984 .
[131] W. Dinkelbach. Die Maximierung eines Quotienten zweier linearer Funktionen unter linearen Nebenbedingungen , 1962 .
[132] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[133] A. Nemirovskii. On polynomiality of the method of analytic centers for fractional problems , 1996 .
[134] Robert E. Bixby,et al. Implementing the Simplex Method: The Initial Basis , 1992, INFORMS J. Comput..
[135] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .