Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-020-01553-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3007798390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse optimal value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for the Inverse Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted inverse minimum spanning tree problems under Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Inverse Spanning-Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for constraint partial inverse matroid problem with weight increase forbidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty function method for solving inverse optimal value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Inverse Spanning Tree Problems Through Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow method for solving some inverse combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for inverse minimum spanning tree problem / rank
 
Normal rank

Latest revision as of 15:28, 24 July 2024

scientific article
Language Label Description Also known as
English
Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
scientific article

    Statements

    Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2021
    0 references
    minimum spanning tree
    0 references
    \(l_\infty\) norm
    0 references
    inverse optimal value problem
    0 references
    strongly polynomial time algorithm
    0 references

    Identifiers