Pages that link to "Item:Q1843381"
From MaRDI portal
The following pages link to An algorithm for optimizing network flow capacity under economies of scale (Q1843381):
Displaying 14 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- A level set algorithm for a class of reverse convex programs (Q751513) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- Linear programs with an additional reverse convex constraint (Q1140531) (← links)
- Reverse convex programming (Q1147072) (← links)
- Optimal expansion of capacitated transshipment networks (Q1266668) (← links)
- Construction of test problems for a class of reverse convex programs (Q1331094) (← links)
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← links)
- Computational experience using an edge search algorithm for linear reverse convex programs (Q2564611) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
