Generalized network design problems. (Q1810478): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115202288, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Steiner problems and other variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with stochastic demands and restricted failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric generalized traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class Steiner minimal tree problem: A lower bound and test problem generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial constraint satisfaction problem: Facets and lifting theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Generalized Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path with at most / nodes in each of the series/parallel clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected spanning subgraphs and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient composite heuristic for the symmetric generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the generalized Steiner tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank

Latest revision as of 17:21, 5 June 2024

scientific article
Language Label Description Also known as
English
Generalized network design problems.
scientific article

    Statements

    Generalized network design problems. (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    0 references
    Combinatorial optimization
    0 references
    Network design
    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
    0 references