Models and algorithms for network reduction (Q320811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem reduction methods and a tree generation algorithm for the steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation for the Directed Spanner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Based Local Search for the Connected Facility Location and Related 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: Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing minimum routing cost spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing splitter and fiber location in a multilevel optical FTTH network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Service network design in freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of recent research on green road freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for minimum routing cost trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic shortest path algorithms for transportation applications: state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal routing in a transportation network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach to the fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Sparse 2-Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2722092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the optimum communication spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimodal freight transportation planning: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of the contribution of operational research to project management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some optimum communication spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the shortest total path length spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the optimal \(p\)-source communication spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic / rank
 
Normal rank

Revision as of 15:57, 12 July 2024

scientific article
Language Label Description Also known as
English
Models and algorithms for network reduction
scientific article

    Statements

    Models and algorithms for network reduction (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    networks
    0 references
    large scale optimization
    0 references
    heuristics
    0 references
    shortest path
    0 references
    dual ascent
    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