A bilinear relaxation based algorithm for concave piecewise linear network flow problems
From MaRDI portal
Publication:2468881
DOI10.3934/jimo.2007.3.71zbMath1166.90360OpenAlexW2318674522MaRDI QIDQ2468881
Panos M. Pardalos, Artyom Nahapetyan
Publication date: 11 February 2008
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2007.3.71
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Bilinear modeling solution approach for fixed charge network flow problems, A review of recent advances in global optimization, A polynomial local optimality condition for the concave piecewise linear network flow problem, Simplifying the nonlinear continuous time-cost tradeoff problem, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Double-row facility layout with replicate machines and split flows, Convexification of bilinear forms through non-symmetric lifting
