Concave Minimization: Theory, Applications and Algorithms
暂无分享,去创建一个
[1] Hanif D. Sherali,et al. A branch and bound algorithm for extreme point mathematical programming problems , 1985, Discret. Appl. Math..
[2] Hoang Tuy,et al. The complementary convex structure in global optimization , 1992, J. Glob. Optim..
[3] Faiz A. Al-Khayyal,et al. A class of global optimization problems solvable by sequential unconstrained convex minimization , 1992 .
[4] A. Ravindran,et al. A vertex ranking algorithm for the fixed-charge transportation problem , 1982 .
[5] Yves Pochet. Valid inequalities and separation for capacitated economic lot sizing , 1988 .
[6] Uwe H. Suhl. Solving large-scale mixed-integer programs with fixed charge variables , 1985, Math. Program..
[7] Reiner Horst,et al. The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization , 1990, Applied Geometry And Discrete Mathematics.
[8] G. Nemhauser,et al. Integer Programming , 2020 .
[9] H. P. Benson,et al. The Vector Maximization Problem: Proper Efficiency and Stability , 1977 .
[10] R. Horst,et al. Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems , 1992 .
[11] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .
[12] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .
[13] R. S. Laundy,et al. Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .
[14] Harold P. Benson,et al. A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case , 1993, J. Glob. Optim..
[15] Panos M. Pardalos,et al. Recent Advances in Global Optimization , 1991 .
[16] Arthur F. Veinott,et al. The Supporting Hyperplane Method for Unimodal Programming , 1967, Oper. Res..
[17] James E. Falk,et al. Concave Minimization Via Collapsing Polytopes , 1986, Oper. Res..
[18] Francisco Barahona,et al. A solvable case of quadratic 0-1 programming , 1986, Discret. Appl. Math..
[19] A. Victor Cabot,et al. Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points , 1970, Oper. Res..
[20] B. Martos. The Direct Power of Adjacent Vertex Programming Methods , 1965 .
[21] J. Ben Rosen,et al. An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions , 1987, Math. Oper. Res..
[22] Hoang Tuy,et al. An efficient solution method for rank two quasiconcave minimization problems , 1992 .
[23] B. K. Mishra,et al. Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming , 1985 .
[24] Reiner Horst,et al. A new simplicial cover technique in constrained global optimization , 1992, J. Glob. Optim..
[25] R. Horst,et al. On finding new vertices and redundant constraints in cutting plane algorithms for global optimization , 1988 .
[26] James E. Falk,et al. A Strategic Weapons Exchange Allocation Model , 1977, Oper. Res..
[27] V. Klee,et al. Convex functions and upper semi-continuous collections , 1952 .
[28] Paul Gray,et al. Technical Note - Exact Solution of the Fixed-Charge Transportation Problem , 1971, Oper. Res..
[29] Fred W. Glover,et al. Polyhedral annexation in mixed integer and combinatorial programming , 1975, Math. Program..
[30] Hanif D. Sherali,et al. A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..
[31] Michael Florian,et al. Nonlinear cost network models in transportation analysis , 1986 .
[32] J. B. Rosen. Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain , 1983, Math. Oper. Res..
[33] B. Eaves. The Linear Complementarity Problem , 1971 .
[34] Richard E. Stone. Geometric aspects of the linear complementarity problem , 1981 .
[35] A. Cabot. Variations on a cutting plane method for solving concave minimization problems with linear constraints , 1974 .
[36] Edward P. C. Kao,et al. A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs , 1979, Oper. Res..
[37] R. Soland. An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints , 1971 .
[38] Hoang Tuy,et al. A class of exhaustive cone splitting procedures in conical algorithms for concave minmization , 1987 .
[39] Hiroshi Konno,et al. BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING , 1989 .
[40] J. B. Rosen,et al. Methods for global concave minimization: A bibliographic survey , 1986 .
[41] J. Ben Rosen,et al. A parallel algorithm for constrained concave quadratic global minimization , 1988, Math. Program..
[42] T. V. Thieu. A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications , 1988 .
[43] Sihem BenSaad. A new cutting plane-algorithm for a class of reverse convex 0–1 integer programs , 1992 .
[44] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[45] R. Horst,et al. On the convergence of global methods in multiextremal optimization , 1987 .
[46] Hamdy A. Taha. Concave minimization over a convex polyhedron , 1973 .
[47] J. E. Falk,et al. Infinitely constrained optimization problems , 1976 .
[48] R. Horst,et al. Outer approximation by polyhedral convex sets , 1987 .
[49] Richard S. Bassein,et al. An Optimization Problem , 1989 .
[50] Panos M. Pardalos,et al. GLOBAL OPTIMIZATION ALGORITHMS FOR LINEARLY CONSTRAINED INDEFINITE QUADRATIC PROBLEMS , 1991 .
[51] S. Selcuk Erenguc,et al. An algorithm for indefinite integer quadratic programming , 1991 .
[52] Reiner Horst,et al. On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization , 1991 .
[53] Harold P. Benson. Separable concave minimization via partial outer approximation and branch and bound , 1990 .
[54] Jacob Ponstein. Convexity and Duality in Optimization , 1985 .
[55] R. Horst,et al. On the global minimization of concave functions , 1984 .
[56] Hiroshi Konno,et al. A parametric successive underestimation method for convex multiplicative programming problems , 1991, J. Glob. Optim..
[57] H. G. Eggleston. Convexity by H. G. Eggleston , 1958 .
[58] Bahman Kalantari,et al. An algorithm for quadratic zero-one programs , 1990 .
[59] Michael Florian,et al. An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem , 1971 .
[60] Harold P. Benson,et al. On the convergence of two branch-and-bound algorithms for nonconvex programming problems , 1982 .
[61] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..
[62] G. McCormick. Nonlinear Programming: Theory, Algorithms and Applications , 1983 .
[63] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[64] Ubaldo M. García-Palomares,et al. On the minimization of a quasi-concave function subject to linear constraints , 1991, Oper. Res. Lett..
[65] Manuel J. Carrillo. A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron , 1977, Math. Program..
[66] Gary R. Reeves. Global Minimization in Nonconvex All-Quadratic Programming , 1975 .
[67] Reiner Horst,et al. A note on the convergence of an algorithm for nonconvex programming problems , 1980, Math. Program..
[68] Serpil Sayin,et al. A finite concave minimization algorithm using branch and bound and neighbor generation , 1994, J. Glob. Optim..
[69] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[70] Harold P. Benson,et al. Multiple Objective Linear Programming with Parametric Criteria Coefficients , 1985 .
[71] P. Pardalos. Complexity in numerical optimization , 1993 .
[72] R. Horst,et al. On an outer approximation concept in global optimization , 1989 .
[73] J. E. Falk. Lagrange Multipliers and Nonconvex Programs , 1969 .
[74] R. Horst. On consistency of bounding operations in deterministic global optimization , 1989 .
[75] H. P. Benson,et al. An algorithm for optimizing over the weakly-efficient set , 1986 .
[76] Gabriel R. Bitran,et al. Approximation Methods for the Uncapacitated Dynamic Lot Size Problem , 1984 .
[77] Jan van Tiel,et al. Convex Analysis: An Introductory Text , 1984 .
[78] Reiner Horst,et al. On solving general reverse convex programming problems by a sequence of linear programs and line searches , 1990 .
[79] C. M. Shetty,et al. A cutting plane algorithm for the bilinear programming problem , 1977 .
[80] Reiner Horst,et al. Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems , 1988, Math. Program..
[81] M. Balinski. Fixed‐cost transportation problems , 1961 .
[82] Gerald L. Thompson,et al. A Simplex-Like Algorithm for the Continuous Modular Design Problem , 1977, Oper. Res..
[83] Pierre Hansen,et al. On-line and off-line vertex enumeration by adjacency lists , 1991, Oper. Res. Lett..
[84] Johan Philip,et al. Algorithms for the vector maximization problem , 1972, Math. Program..
[85] J. Ben Rosen,et al. Penalty for zero–one integer equivalent problem , 1982, Math. Program..
[86] A. Ioffe,et al. Theory of extremal problems , 1979 .
[87] János Fülöp,et al. A cutting plane algorithm for linear optimization over the efficient set , 1994 .
[88] C. B. Millham,et al. The Optimal Location of Nuclear-Power Facilities in the Pacific Northwest , 1974, Oper. Res..
[89] P. Pardalos,et al. Checking local optimality in constrained quadratic programming is NP-hard , 1988 .
[90] C. M. Shetty,et al. The bilinear programming problem , 1976 .
[91] H. Tuy,et al. A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set , 1985, Math. Oper. Res..
[92] K. Grasse,et al. A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization , 1986 .
[93] Antal Majthay,et al. Quasi-concave minimization subject to linear constraints , 1974, Discret. Math..
[94] K. Swarup,et al. Extreme Point Mathematical Programming , 1972 .
[95] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[96] Philip B. Zwart. Global Maximization of a Convex Function with Linear Inequality Constraints , 1974, Oper. Res..
[97] Arthur F. Veinott,et al. Existence and characterization of minima of concave functions on unbounded convex sets , 1985 .
[98] J. Krarup,et al. Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .
[99] Harish Vaish,et al. Nonconvex programming with applications to production and location problems , 1974 .
[100] Panos M. Pardalos,et al. ON THE SOLUTION OF INDEFINITE QUADRATIC PROBLEMS USING AN INTERIOR-POINT ALGORITHM , 1992 .
[101] J. Hiriart-Urruty. Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions , 1985 .
[102] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[103] Phan Thien Thach. Quasiconjugates of functions, duality relationship between Quasiconvex Minimization under a Reverse Convex Constraint and Quasiconvex Maximization under a Convex Constraint, and applications☆ , 1991 .
[104] Laurence A. Wolsey,et al. Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..
[105] C. Lemaréchal. Nondifferentiable optimization , 1989 .
[106] Hanif D. Sherali,et al. On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem , 1982 .
[107] Nguyen V. Thoai,et al. Concave minimization via conical partitions and polyhedral outer approximation , 1991, Math. Program..
[108] F. J. Gould,et al. Complementary pivoting on a pseudomanifold structure with applications in the decision sciences , 1983 .
[109] Kristin P. Bennett,et al. Bilinear separation of two sets inn-space , 1993, Comput. Optim. Appl..
[110] Panos M. Pardalos,et al. Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .
[111] Panos M. Pardalos,et al. Global minimization of large-scale constrained concave quadratic problems by separable programming , 1986, Math. Program..
[112] Hoang Tuy,et al. Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms , 1991, J. Glob. Optim..
[113] Hanif D. Sherali,et al. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts , 1980, Math. Program..
[114] Arthur F. Veinott,et al. Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..
[115] Hoang Tuy,et al. On nonconvex optimization problems with separated nonconvex variables , 1992, J. Glob. Optim..
[116] Jonathan F. Bard,et al. A separable programming approach to the linear complementarity problem , 1982, Comput. Oper. Res..
[117] M. Locatelli,et al. Simple linkage: Analysis of a threshold-accepting global optimization method , 1996, J. Glob. Optim..
[118] James E. Falk,et al. A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..
[119] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.
[120] Hiroshi Konno,et al. Generalized linear multiplicative and fractional programming , 1991 .
[121] S. Selcuk Erenguc,et al. Using convex envelopes to solve the interactive fixed-charge linear programming problem , 1988 .
[122] E. Beale,et al. Applications of Mathematical Programming Techniques. , 1971 .
[123] Katta G. Murty,et al. Linear complementarity, linear and nonlinear programming , 1988 .
[124] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .
[125] Yash P. Aneja,et al. On a class of quadratic programs , 1984 .
[126] A. Victor Cabot,et al. Some branch‐and‐bound procedures for fixed‐cost transportation problems , 1984 .
[127] A. Manne. Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .
[128] Peter Värbrand,et al. A global optimization approach for the linear two-level program , 1993, J. Glob. Optim..
[129] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[130] Reiner Horst,et al. On the convexification of nonlinear programming problems: An applications-oriented survey , 1984 .
[131] Panos M. Pardalos,et al. Advances in Optimization and Parallel Computing , 1992 .
[132] Reiner Horst,et al. Deterministic methods in constrained global optimization: Some recent advances and new fields of application , 1990 .
[133] Arthur M. Geoffrion,et al. Solving Bicriterion Mathematical Programs , 1967, Oper. Res..
[134] N. Thoai,et al. On geometry and convergence of a class of simplicial covers , 1992 .
[135] Alan M. Frieze,et al. A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..
[136] G. W. Evans,et al. An Overview of Techniques for Solving Multiobjective Mathematical Programs , 1984 .
[137] P. Hartman. On functions representable as a difference of convex functions , 1959 .
[138] W. Zangwill. A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .
[139] Ralph E. Steuer,et al. Computational experience concerning payoff tables and minimum criterion values over the efficient set , 1988 .
[140] R. Soland,et al. A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems , 1969 .
[141] Harold P. Benson,et al. Vector maximization with two objective functions , 1979 .
[142] R. Horst,et al. A note on adapting methods for continuous global optimization to the discrete case , 1991 .
[143] H. Tuy,et al. Strongly polynomial algorithm for a production-transportation problem with concave production cost , 1993 .
[144] Richard M. Soland,et al. A BRANCH-AND-BOUND ALGORITHM FOR MULTILEVEL FIXED-COST PROBLEMS. , 1967 .
[145] A. Victor Cabot,et al. A branch and bound algorithm for solving a class of nonlinear integer programming problems , 1986 .
[146] A. A. Goldstein,et al. Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.
[147] Fred W. Glover,et al. A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..
[148] Arnold Neumaier,et al. An optimality criterion for global quadratic optimization , 1992, J. Glob. Optim..
[149] B. Kalantari. Quadratic functions with exponential number of local maxima , 1986 .
[150] F. Al-Khayyal,et al. Global optimization of a quadratic function subject to a bounded mixed integer consraint set , 1991 .
[151] H. Tuy. Convex programs with an additional reverse convex constraint , 1987 .
[152] S. Selcuk Erenguc,et al. An algorithm for concave integer minimization over a polyhedron , 1990 .
[153] S. Itoh,et al. Variational inequalities and complementarity problems , 1978 .
[154] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.
[155] Reiner Horst,et al. On solving a D.C. programming problem by a sequence of linear programs , 1991, J. Glob. Optim..
[156] James E. Falk,et al. Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..
[157] Hanif D. Sherali,et al. A squared-euclidean distance location-allocation problem , 1992 .
[158] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .
[159] Hoang Tuy,et al. Concave minimization under linear constraints with special structure , 1985 .
[160] Philip B. Zwart,et al. Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms , 1973, Oper. Res..
[161] P. Loridan,et al. Approximation of solutions for location problems , 1988 .
[162] Lakshman S. Thakur,et al. Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron , 1991, Math. Oper. Res..
[163] Immanuel M. Bomze,et al. Using copositivity for global optimality criteria in concave quadratic programming problems , 1993, Math. Program..
[164] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .
[165] O. Mangasarian,et al. Two-person nonzero-sum games and quadratic programming , 1964 .
[166] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .
[167] James E. Falk,et al. A linear max—min problem , 1973, Math. Program..
[168] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[169] M. R. Rao,et al. An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .
[170] Siegfried Schaible. On factored quadratic functions , 1973, Z. Oper. Research.
[171] Kurt Spielberg,et al. Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..
[172] Reiner Horst,et al. An algorithm for nonconvex programming problems , 1976, Math. Program..
[173] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[174] L. Wolsey,et al. Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .
[175] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .
[176] M. Raghavachari,et al. On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints , 1969, Oper. Res..
[177] S. Kumar,et al. Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom , 1980 .
[178] C. M. Shetty,et al. Rectilinear Distance Location-Allocation Problem: A Simplex Based Algorithm , 1980 .
[179] János Fülöp. A finite procedure to generate feasible points for the extreme point mathematical programming problem , 1988 .
[180] Willard I. Zangwill,et al. A Deterministic Multiproduct, Multi-Facility Production and Inventory Model , 1966, Oper. Res..
[181] Robert G. Batson. On constrained maxima of convex functions , 1986 .
[182] H. Weinert. Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1) , 1979 .
[183] J. K. Lenstra,et al. Combinatorial optimization : annotated bibliographies , 1985 .
[184] Panos M. Pardalos,et al. Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming , 1992, Ann. Oper. Res..
[185] Panos M. Pardalos,et al. Active constraints, indefinite quadratic test problems, and complexity , 1991 .
[186] Clarence Zener,et al. Geometric Programming : Theory and Application , 1967 .
[187] Harold P. Benson,et al. An all-linear programming relaxation algorithm for optimizing over the efficient set , 1991, J. Glob. Optim..
[188] Stephen E. Jacobsen. Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints , 1981 .
[189] H. P. Benson,et al. Existence of efficient solutions for vector maximization problems , 1978 .
[190] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .
[191] M. Dessouky,et al. Estimates of the minimum nondominated criterion values in multiple-criteria decision-making , 1986 .
[192] Harold P. Benson,et al. On the structure and properties of a linear multilevel programming problem , 1989 .
[193] H. Tuy. A General Deterministic Approach to Global Optimization VIA D.C. Programming , 1986 .
[194] M. Kostreva,et al. Global solvability of generalized linear complementarity problems and a related class of polynomial complementarity problems , 1992 .
[195] Heinz Bauer,et al. Minimalstellen von Funktionen und Extremalpunkte , 1958 .
[196] Anthony Wren,et al. The land-use/transport system , 1971 .
[197] Jerald P. Dauer,et al. Optimization over the efficient set using an active constraint approach , 1991, ZOR Methods Model. Oper. Res..
[198] J. Ben Rosen,et al. A parallel stochastic method for solving linearly constrained concave global minimization problems , 1992, J. Glob. Optim..
[199] Amine R. Alameddine. A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management , 1990 .
[200] Hoang Tuy. Normal conical algorithm for concave minimization over polytopes , 1991, Math. Program..
[201] J. B. Rosen,et al. Global optimization approach to the linear complementarity problem , 1988 .
[202] Nguyen V. Thoai. A global optimization approach for solving the convex multiplicative programming problem , 1991, J. Glob. Optim..
[203] R. Kellogg,et al. Pathways to solutions, fixed points, and equilibria , 1983 .
[204] J. B. Rosen,et al. A parallel algorithm for partially separable non-convex global minimization: Linear constraints , 1990 .
[205] Alexander H. G. Rinnooy Kan,et al. Concurrent stochastic methods for global optimization , 1990, Math. Program..
[206] Kurt M. Bretthauer,et al. An algorithm and new penalties for concave integer minimization over a polyhedron , 1994 .
[207] Bettina Klinz,et al. Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost , 1993 .
[208] Le Dung Muu,et al. Method for minimizing a convex-concave function over a convex set , 1991 .
[209] S. Bolintineanu,et al. Minimization of a quasi-concave function over an efficient set , 1993, Math. Program..
[210] S. E. Jacobsen,et al. Characterization of local solutions for a class of nonconvex programs , 1975 .
[211] Katta G. Murty,et al. Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..
[212] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .
[213] G. McCormick. Attempts to Calculate Global Solutions of Problems that May Have Local Minima , 1971 .
[214] Karla L. Hoffman,et al. A method for globally minimizing concave functions over convex sets , 1981, Math. Program..
[215] H. P. Benson,et al. Optimization over the efficient set , 1984 .
[216] Walter Y. Oi,et al. ECONOMICS OF PRIVATE TRUCK TRANSPORTATION , 1967 .
[217] Stephen E. Jacobsen,et al. A level set algorithm for a class of reverse convex programs , 1990 .
[218] Hoang Tuy,et al. The relief indicator method for constrained global optimization , 1990 .
[219] Giorgio Gallo,et al. Bilinear programming: An exact algorithm , 1977, Math. Program..
[220] Panos M. Pardalos,et al. Polynomial time algorithms for some classes of constrained nonconvex quadratic problems , 1990 .
[221] H. P. Benson,et al. A finite algorithm for concave minimization over a polyhedron , 1985 .
[222] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[223] David S. Rubin. Technical Note - Vertex Generation and Cardinality Constrained Linear Programs , 1975, Oper. Res..
[224] Panos M. Pardalos,et al. A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.
[225] Hoang Tuy,et al. Polyhedral annexaton, dualization and dimension reduction technique in global optimization , 1991, J. Glob. Optim..
[226] Andrew B. Whinston,et al. Optimization over Leontief substitution systems , 1975 .
[227] G. Mitra. Variational Inequalities and Complementarity Problems — Theory and Application , 1980 .
[228] Kurt M. Bretthauer,et al. A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron , 1994, Comput. Oper. Res..
[229] Richard M. Soland,et al. Optimal Facility Location with Concave Costs , 1974, Oper. Res..
[230] Nguyen V. Thoai,et al. Convergent Algorithms for Minimizing a Concave Function , 1980, Math. Oper. Res..
[231] M. C. Puri,et al. Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems , 1973, Z. Oper. Research.
[232] I. Ekeland,et al. Convex analysis and variational problems , 1976 .
[233] Patrick McKeown. Technical Note - A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem , 1975, Oper. Res..
[234] Reiner Horst,et al. A branch and bound-outer approximation algorithm for concave minimization over a convex set , 1991 .
[235] G. McCormick,et al. Selected applications of nonlinear programming , 1968 .
[236] W. Greub. Linear Algebra , 1981 .
[237] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[238] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .
[239] D. I. Steinberg,et al. The fixed charge problem , 1970 .
[240] R. Hoprst. Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization reverse convex , 1988 .
[241] O. Mangasarian. Equilibrium Points of Bimatrix Games , 1964 .
[242] Faiz A. Al-Khayyal,et al. Linear, quadratic, and bilinear programming approaches to the linear complementarity problem , 1986 .
[243] S. E. Jacobsen,et al. Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes , 1988, Math. Oper. Res..
[244] Donald M. Topkis,et al. Cutting-Plane Methods without Nested Constraint Sets , 1970, Oper. Res..
[245] R. Cassidy,et al. Efficient Distribution of Resources Through Three Levels of Government , 1971 .
[246] S. S. Erenguc,et al. The interactive fixed charge linear programming problem , 1986 .
[247] J. Ben Rosen,et al. Sufficient conditions for solving linearly constrained separable concave global minimization problems , 1993, J. Glob. Optim..
[248] N. Thoai,et al. A modified version of TUY’s method for solving d.c. programming problems , 1988 .
[249] H. P. Benson,et al. Algorithms for parametric nonconvex programming , 1982 .