Pages that link to "Item:Q1806939"
From MaRDI portal
The following pages link to Probabilistic local search algorithms for concave cost transportation network problems (Q1806939):
Displaying 11 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- A restricted-entry method for a transportation problem with piecewise- linear concave costs (Q1332825) (← links)
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges (Q1397637) (← links)
- The concave cost supply problem. (Q1810527) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- A continuous approach for the concave cost supply problem via DC programming and DCA (Q2473032) (← links)
- Solving a Freight Transport Problem Using Facility Location Techniques (Q3202099) (← links)
- An adaptive tabu-simulated annealing for concave cost transportation problems (Q3515498) (← links)
- (Q5020887) (← links)
- (Q5488955) (← links)