A concavity result for network design problems
From MaRDI portal
Recommendations
- Network transportation problem with concave cost functions of the flux on network edges and its applications
- On minimum concave cost network flow problems
- A polynomial time solvable concave network flow problem
- scientific article; zbMATH DE number 1157097
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
Cited in
(11)- Design of a single window system for e-government services: the Chilean case
- Network-related problems in optimal experimental design and second order cone programming
- scientific article; zbMATH DE number 2132072 (Why is no real title available?)
- scientific article; zbMATH DE number 1864546 (Why is no real title available?)
- An Integral Inequality for Convex Functions, with Application to Teletraffic Congestion Problems
- Necessary and sufficient condition for non-concave network utility maximisation
- Network transportation problem with concave cost functions of the flux on network edges and its applications
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
- The convex hull of two core capacitated network design problems
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- On the extremal structure of an OSPF related cone
This page was built for publication: A concavity result for network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862177)
