Heuristics for the generalized median graph problem
From MaRDI portal
Publication:323345
DOI10.1016/J.EJOR.2016.03.048zbMATH Open1346.90790OpenAlexW2187112766MaRDI QIDQ323345FDOQ323345
Celso C. Ribeiro, Leonardo M. Musmanno
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.048
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized median graphs and applications
- GRASP: An annoted bibliography
- Finding a Maximum Clique in an Arbitrary Graph
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Probability distribution of solution time in GRASP: an experimental investigation
- TTT plots: a perl program to create time-to-target plots
- On the minimum common supergraph of two graphs
- A long trip in the charming world of graphs for pattern recognition
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Topology of strings: median string is NP-complete
- Median graphs: A genetic approach based on new theoretical properties
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- Backtrack search algorithms and the maximal common subgraph problem
- Computing approximate tree edit distance using relaxation labeling
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Generalized median graph computation by means of graph embedding in vector spaces
Cited In (2)
Uses Software
This page was built for publication: Heuristics for the generalized median graph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323345)
