Discrete Monotonic Optimization with Application to a Discrete Location Problem
From MaRDI portal
Publication:5470245
DOI10.1137/04060932XzbMath1112.90099MaRDI QIDQ5470245
N. T. Hoai-Phuong, Hoang Tuy, Michel Minoux
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
discrete optimizationdiscrete locationdesign centeringmonotonic optimizationbranch-reduce-and-bound algorithmdifferences of increasing functionsmonotonicity cutspolyblock approximation
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
A partial enumeration algorithm for pure nonlinear integer programming, A robust algorithm for quadratic optimization under quadratic constraints, Optimization of a quadratic function with a circulant matrix, Locating waste pipelines to minimize their impact on marine environment, Conjugate duality and optimization over weakly efficient set, Monotonic optimization based decoding for linear codes, Unnamed Item, A new topological minimax theorem with application, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects, Monotonic optimization for sensor cover energy problem, Problems with resource allocation constraints and optimization over the efficient set
