A composite algorithm for a concave-cost network flow problem

Recommendations

Cited in

(36)

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

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)