The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
From MaRDI portal
Publication:2348064
DOI10.1016/j.dam.2015.01.035zbMath1315.05069OpenAlexW1969506670MaRDI QIDQ2348064
Camilo Ortiz-Astorquiza, Gilbert Laporte, Iván A. Contreras
Publication date: 10 June 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.035
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Flows in graphs (05C21)
Related Items (2)
Exact and heuristic approaches for the cycle hub location problem ⋮ The capacitated directed cycle hub location and routing problem under congestion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Lagrangean bounds for the optimum communication spanning tree problem
- Exact and heuristic procedures for the material handling circular flow path design problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- 0-1 reformulations of the multicommodity capacitated network design problem
- On the quadratic assignment problem
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Exact and heuristic approaches for the cycle hub location problem
- General network design: a unified view of combined location and network design problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- Dual track and segmented single track bidirectional loop guidepath layout for AGV systems
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- Three Ideas for the Quadratic Assignment Problem
- Optimum Communication Spanning Trees
- On a routing problem
- Assignment Problems and the Location of Economic Activities
- Integer Programming Formulation of Traveling Salesman Problems
- Locating a cycle in a transportation or a telecommunications network
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- The complexity of the network design problem
- Scheduling and routing algorithms for AGVs: A survey
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Improved Discrete Reformulations for the Quadratic Assignment Problem
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: The minimum flow cost Hamiltonian cycle problem: a comparison of formulations