Counting difficult tree pairs with respect to the rotation distance problem

被引：0

作者：

机构：

[1] Cleary, Sean

[2] Maio, Roland

来源：

| 1600年 / Charles Babbage Research Centre卷 / 115期

关键词：

Rotation;

D O I：

暂无

中图分类号：

O3 [力学];

学科分类号：

08 ; 0801 ;

摘要：

引用

共 49 条

[41] Inverse max sum spanning tree problem under Hamming distance by modifying the sum-cost vector
Guan, Xiucui
He, Xinyan
Pardalos, Panos M.
Zhang, Binwu
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 69 (04) : 911 - 925
[42] Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
Friedrich, Christian
Klausnitzer, Armin
Lasch, Rainer
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (03) : 837 - 851
[43] Inverse min-max spanning tree problem under the weighted sum-type hamming distance
Liu, Longcheng
Yao, Enyu
COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 375 - +
[44] Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance
Liu, Longcheng
Yao, Enyu
THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 28 - 34
[45] A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem
Arbelaez, Alejandro
Mehta, Deepak
O'Sullivan, Barry
Quesada, Luis
INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING, 2015, 9075 : 31 - 46
[46] Study on Similar Engineering Decision Problem Identification Based On Combination of Improved Edit-Distance and Skeletal Dependency Tree with POS
Hu, Dong-bin
Ding, Jun
ENGINEERING AND RISK MANAGEMENT, 2011, 1 : 406 - 413
[47] A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem
Arbelaez, Alejandro
Mehta, Deepak
O'Sullivan, Barry
Quesada, Luis
JOURNAL OF HEURISTICS, 2018, 24 (03) : 359 - 394
[48] A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem
Alejandro Arbelaez
Deepak Mehta
Barry O’Sullivan
Luis Quesada
Journal of Heuristics, 2018, 24 : 359 - 394
[49] Inverse max +\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+$$\end{document} sum spanning tree problem under Hamming distance by modifying the sum-cost vector
Xiucui Guan
Xinyan He
Panos M. Pardalos
Binwu Zhang
Journal of Global Optimization, 2017, 69 (4) : 911 - 925

← 1 2 3 4 5 →