A note on adapting methods for continuous global optimization to the discrete case
From MaRDI portal
Publication:2276877
DOI10.1007/BF02283698zbMath0723.90055MaRDI QIDQ2276877
Reiner Horst, S. Selcuk Erenguc, Harold P. Benson
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
global optimizationbranch and boundreverse convex constraintsLipschitzian optimizationdiscrete concave optimization
Integer programming (90C10) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A new exact algorithm for concave knapsack problems with integer variables, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Unnamed Item, Capacity planning in networks of queues with manufacturing applications, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, A hybrid method for quantum global optimization, A heuristic algorithm for a chance constrained stochastic program, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, A discrete dynamic convexized method for nonlinear integer programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A provable better Branch and Bound method for a nonconvex integer quadratic programming problem, Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming, Capacity planning in manufacturing and computer networks, Nonlinear programming for multiperiod capacity planning in a manufacturing system, The nonlinear knapsack problem - algorithms and applications, Exact algorithm for concave knapsack problems: linear underestimation and partition method
Cites Work
- Unnamed Item
- 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
- On the convergence of global methods in multiextremal optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- 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
- Algorithms for parametric nonconvex programming
- Separable concave minimization via partial outer approximation and branch and bound
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A finite algorithm for concave minimization over a polyhedron
- Concave Minimization Via Collapsing Polytopes
- A method for globally minimizing concave functions over convex sets
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- An algorithm for nonconvex programming problems
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- An Algorithm for Separable Nonconvex Programming Problems
