Solving the optimum communication spanning tree problem (Q1991267): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
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: Acceleration of cutting-plane and column generation algorithms: Applications to network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean bounds for the optimum communication spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders Decomposition Approach for the Locomotive and Car Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Assignment of Locomotives and Cars to Passenger Trains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / 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: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / 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: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to a problem in network design using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated airline scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of optimal methods for local access uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Solutions for the Optimal Communication Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg. / 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: Combined column-and-row-generation for the optimal communication spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation scheme for the two-source minimum routing cost spanning trees / 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: A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank

Revision as of 03:01, 17 July 2024

scientific article
Language Label Description Also known as
English
Solving the optimum communication spanning tree problem
scientific article

    Statements

    Solving the optimum communication spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2018
    0 references
    networks
    0 references
    network optimization
    0 references
    Benders decomposition
    0 references
    spanning trees
    0 references
    0 references
    0 references
    0 references

    Identifiers

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