The interactive fixed charge linear programming problem
From MaRDI portal
Publication:3731367
DOI10.1002/nav.3800330202zbMath0597.90057MaRDI QIDQ3731367
Harold P. Benson, S. Selcuk Erenguc
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330202
branch and bound; optimal solution; linear subproblems; interactive fixed charge linear programming problem
Related Items
Using convex envelopes to solve the interactive fixed-charge linear programming problem, The interactive fixed charge inhomogeneous flows optimization problem, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Discontinuous piecewise linear optimization, A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
Cites Work