Pages that link to "Item:Q1919095"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095):
Displaying 19 items.
- Coalition structure generation: a survey (Q900307) (← links)
- Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
- A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem (Q1365379) (← links)
- A pseudo-polynomial algorithm for solving rank three concave production-transportation problems (Q1384430) (← links)
- Two level hierarchical time minimizing transportation problem (Q1769948) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost (Q1923788) (← links)
- Solving the production transportation problem via a deterministic annealing neural network method (Q2245991) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Max-min sum minimization transportation problem (Q2507394) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems. (Q2773173) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
