Pages that link to "Item:Q3827773"
From MaRDI portal
The following pages link to A composite algorithm for a concave-cost network flow problem (Q3827773):
Displaying 25 items.
- Supply chain design considering economies of scale and transport frequencies (Q439589) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- A dynamic inventory model with supplier selection in a serial supply chain structure (Q2355942) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- Best routes selection in international intermodal networks (Q2475845) (← links)
- Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
- Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Single‐warehouse multi‐retailer inventory systems with full truckload shipments (Q5187943) (← links)
- Exact algorithms for integrated facility location and production planning problems (Q5198685) (← links)
- A Two-Echelon Neighborhood Search Algorithm for a Forwarder's Job Assignment in a Multi-Agent Logistics Network (Q5265459) (← links)
- The plant location and flexible technology acquisition problem. (Q5953331) (← links)
