Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm |
scientific article; zbMATH DE number 6387232
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm |
scientific article; zbMATH DE number 6387232 |
Statements
Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (English)
0 references
16 January 2015
0 references
inverse max + sum spanning tree problem
0 references
inverse optimization problem
0 references
\(l_\infty \) norm
0 references
linear fractional combinatorial optimization
0 references
discrete-ype Newton method
0 references
0 references
0 references
0 references
