Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479): 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/s10878-006-9016-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039796154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse optimal value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / 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: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / 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: Weighted inverse minimum spanning tree problems under Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse conic programming with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: An inverse problem of the weighted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum capacity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two general methods for inverse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further study on inverse linear programming problems / 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 09:59, 27 June 2024

scientific article
Language Label Description Also known as
English
Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
scientific article

    Statements

    Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (English)
    0 references
    12 October 2007
    0 references
    Inverse min-max network problem
    0 references
    Bound constraints
    0 references
    Polynomial time algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers