A composite algorithm for a concave-cost network flow problem

From MaRDI portal
Publication:3827773

DOI10.1002/net.3230190202zbMath0673.90034OpenAlexW2002111665MaRDI QIDQ3827773

Anantaram Balakrishnan, Stephen C. Graves

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190202



Related Items

Minimum cost delivery of multi-item orders in e-commerce logistics, Multi-market portfolio optimization with conditional value at risk, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, Optimal Network Design with End-to-End Service Requirements, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Supply chain design considering economies of scale and transport frequencies, Locally ideal formulations for piecewise linear functions with indicator variables, Nonconvex, lower semicontinuous piecewise linear optimization, Models for the piecewise linear unsplittable multicommodity flow problems, Best routes selection in international intermodal networks, Models and solution techniques for production planning problems with increasing byproducts, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Separable convexification and DCA techniques for capacity and flow assignment problems, Single‐warehouse multi‐retailer inventory systems with full truckload shipments, A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, The plant location and flexible technology acquisition problem., Exact algorithms for integrated facility location and production planning problems, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, 0-1 reformulations of the multicommodity capacitated network design problem, An algorithm for a concave production cost network flow problem, A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network, Global and local search algorithms for concave cost transshipment problems, A dynamic inventory model with supplier selection in a serial supply chain structure