A composite algorithm for a concave-cost network flow problem

Recommendations

Cited in

(37)

0-1 reformulations of the multicommodity capacitated network design problem
An algorithm for a concave production cost network flow problem
On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
Models for the piecewise linear unsplittable multicommodity flow problems
A deterministic annealing algorithm for the minimum concave cost network flow problem
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
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
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
A dynamic inventory model with supplier selection in a serial supply chain structure
Locally ideal formulations for piecewise linear functions with indicator variables
Best routes selection in international intermodal networks
A linear model for compound multicommodity network flow problems
Minimum cost delivery of multi-item orders in e-commerce logistics
Multi-market portfolio optimization with conditional value at risk
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
Separable convexification and DCA techniques for capacity and flow assignment problems.
A hybrid algorithm for solving convex separable network flow problems
Send-and-Split Method for Minimum-Concave-Cost Network Flows
An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs
New formulation and relaxation to solve a concave-cost network flow problem
scientific article; zbMATH DE number 1157097 (Why is no real title available?)
Supply chain design considering economies of scale and transport frequencies
An exact algorithm for the min-cost network containment problem
Optimal network design with end-to-end service requirements
scientific article; zbMATH DE number 1836457 (Why is no real title available?)
Single-warehouse multi-retailer inventory systems with full truckload shipments
Exact algorithms for integrated facility location and production planning problems
Network flow optimization with minimum quantities
A two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics network
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
The plant location and flexible technology acquisition problem.
A mixed-integer optimization formulation for buyer formation
Global and local search algorithms for concave cost transshipment problems
Nonconvex, lower semicontinuous piecewise linear optimization
Network optimization with piecewise linear convex costs

This page was built for publication: A composite algorithm for a concave-cost network flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827773)