A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
From MaRDI portal
Publication:1332814
DOI10.1016/0305-0548(94)90007-8zbMath0805.90087OpenAlexW1987622728MaRDI QIDQ1332814
Kurt M. Bretthauer, A. Victor Cabot
Publication date: 5 September 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90007-8
Related Items
Nonconvex optimization over a polytope using generalized capacity improvement, Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Concave minimization via conical partitions and polyhedral outer approximation
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- Constrained global optimization: algorithms and applications
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Minimum concave cost production system: A further generalization of multi-echelon model
- Relationship between bilinear programming and concave minimization under linear constraints
- Normal conical algorithm for concave minimization over polytopes
- On the minimization of a quasi-concave function subject to linear constraints
- Global search algorithms for minimum concave-cost network flow problems
- Quasi-concave minimization subject to linear constraints
- A note on adapting methods for continuous global optimization to the discrete case
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Separable concave minimization via partial outer approximation and branch and bound
- An algorithm for concave integer minimization over a polyhedron
- Solving Large-Scale Zero-One Linear Programming Problems
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A finite algorithm for concave minimization over a polyhedron
- The interactive fixed charge linear programming problem
- Methods for Global Concave Minimization: A Bibliographic Survey
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- Concave Minimization Via Collapsing Polytopes
- Multiproduct dynamic lot-sizing model with coordinated replenishments
- Convergent Algorithms for Minimizing a Concave Function
- Global Maximization of a Convex Function with Linear Inequality Constraints
- An algorithm for nonconvex programming problems
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- Characterization of linear complementarity problems as linear programs
- An algorithm and new penalties for concave integer minimization over a polyhedron
- A linear max—min problem
- Optimal Facility Location with Concave Costs
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Concave minimization over a convex polyhedron
- An Algorithm for Separable Nonconvex Programming Problems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
