Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digraph coloring problems and treewidth duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval data minmax regret network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Latest revision as of 17:40, 27 June 2024

scientific article; zbMATH DE number 5246001
Language Label Description Also known as
English
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
scientific article; zbMATH DE number 5246001

    Statements

    Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2008
    0 references
    Robust optimization
    0 references
    Interval data
    0 references
    Shortest path
    0 references
    Spanning tree
    0 references
    Bipartite perfect matching
    0 references

    Identifiers