A survey on combinatorial optimization in dynamic environments (Q2907959): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimizing the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental algorithms for minimal length paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of minimum and maximum traveling salesman's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic a priori routing-location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linear admissible transformations for the m- travelling salesmen problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesman Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vehicle Routing Problem with Stochastic Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Weighted Graph and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the Shortest Common Superstring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the metric deadline TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3079180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner trees: changing the terminal set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast reoptimization for the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probabilistic min spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of maximum weight induced hereditary subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic graph-coloring in bipartite and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line vertex-covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line maximum-order induced hereditary subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online track assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of a random minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good: Approximating independent sets in sparse and bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac78\)-approximation algorithm for metric Max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Data Structures for Fully Dynamic Biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining minimum spanning trees in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized fully dynamic graph algorithms with polylogarithmic time per operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path problems with node failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 71/60 theorem for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic approximation scheme for shortest paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity models for incremental computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic longest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori optimization for the probabilistic maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Minimum Vertex-covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probabilistic minimum coloring and minimum \(k\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Combinatorial Optimization on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / 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: Improved bounds for harmonic-based bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parametric problem of shortest distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with forbidden sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite affine line transitive planes / rank
 
Normal rank

Latest revision as of 15:05, 5 July 2024

scientific article
Language Label Description Also known as
English
A survey on combinatorial optimization in dynamic environments
scientific article

    Statements

    A survey on combinatorial optimization in dynamic environments (English)
    0 references
    0 references
    0 references
    4 September 2012
    0 references
    approximation
    0 references
    reoptimization
    0 references
    hereditary problem
    0 references
    complexity
    0 references
    graph
    0 references
    on-line algorithms
    0 references
    probabilistic optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references