Enumerative techniques for solving some nonconvex global optimization problems
From MaRDI portal
Publication:1102205
DOI10.1007/BF01720032zbMath0643.90082MaRDI QIDQ1102205
Publication date: 1988
Published in: OR Spektrum (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10)
Related Items
Jointly constrained bilinear programs and related problems: An overview, Global search algorithms for minimum concave-cost network flow problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Generalized bilinear programming: An application in farm management, Nonlinear integer programming by Darwin and Boltzmann mixed strategy, Global optimization algorithms for linearly constrained indefinite quadratic problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranking of vertices in the linear fractional programming problem
- Pivoting rules and redundancy schemes in extreme point enumeration
- An algorithm for the min concave cost flow problem
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices
- The Complexity of Vertex Enumeration Methods
- On the application of parallel architectures to a class of operations research problems
- Hard Enumeration Problems in Geometry and Combinatorics
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Nonlinear cost network models in transportation analysis
- An implicit enumeration procedure for the general linear complementarity problem
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- The Complexity of Enumeration and Reliability Problems
- Adjacent extreme flows and application to min concave cost flow problems
- Computational results on an algorithm for finding all vertices of a polytope
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Decomposed enumeration of extreme points in the linear programming problem
- An algorithm for determining all extreme points of a convex polytope
- Concave minimization over a convex polyhedron
- Minimum Concave Cost Flows in Certain Networks
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
