The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064): 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: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual track and segmented single track bidirectional loop guidepath layout for AGV systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic procedures for the material handling circular flow path design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design problems / 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: Exact and heuristic approaches for the cycle hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Ideas for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment 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: Assignment Problems and the Location of Economic Activities / 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: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / 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: A new exact discrete linear reformulation of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Discrete Reformulations for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and routing algorithms for AGVs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems / 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: Q4054818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank

Revision as of 04:40, 10 July 2024

scientific article
Language Label Description Also known as
English
The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
scientific article

    Statements

    The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (English)
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    network design
    0 references
    Hamiltonian cycles
    0 references
    MIP formulations
    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