scientific article; zbMATH DE number 1086909
From MaRDI portal
Publication:4363164
zbMath0878.90098MaRDI QIDQ4363164
No author found.
Publication date: 18 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (20)
Reconstruction of graphs based on random walks ⋮ A constructive algorithm for realizing a distance matrix ⋮ Inverse minimum flow problem ⋮ Imputing a variational inequality function or a convex objective function: a robust approach ⋮ A column generation method for inverse shortest path problems ⋮ Some inverse optimization problems on network ⋮ On the structure of the inverse-feasible region of a linear program ⋮ Inverse optimization in high-speed networks ⋮ Unnamed Item ⋮ NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE ⋮ Inapproximability and a polynomially solvable special case of a network improvement problem. ⋮ Reverse 2-median problem on trees ⋮ Distance spectra of graphs: a survey ⋮ The inverse optimal value problem ⋮ A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm ⋮ Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths ⋮ On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ A further study on inverse linear programming problems ⋮ Inverse optimization problems with multiple weight functions
This page was built for publication:
