MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS
From MaRDI portal
Publication:3456031
DOI10.15807/jorsj.58.184zbMath1328.90124OpenAlexW1556640958MaRDI QIDQ3456031
Akiyoshi Shioura, Kazuo Murota, Satoru Fujishige
Publication date: 11 December 2015
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.58.184
combinatorial optimizationminimum cost flowdiscrete optimizationsteepest ascent algorithmdiscrete concave function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)