Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,104,451 papers from all fields of science
Search
Sign In
Create Free Account
Domination analysis
Known as:
Dominance number
Domination analysis of an approximation algorithm is a way to estimate its performance, introduced by Glover and Punnen in 1997. Unlike the classical…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Approximation algorithm
Dominating set
Randomized algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Effect of various dosage of ammonium glufosinate herbicide on suppressing weeds and growth and yield of corn
D. Widayat
,
Yayan Sumekar
,
A. Wahyudin
,
Y. Yuwariah
,
C. Farida
Journal of Research in Weed Science
2019
Corpus ID: 107305846
Corn is one of the strategic food commodities in Indonesia which is currently widely used as animal feed ingredient. But the…
Expand
2015
2015
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
Abraham P. Punnen
,
Piyashat Sripratak
,
Daniel Karapetyan
Theoretical Computer Science
2015
Corpus ID: 17055790
2015
2015
A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions
Brad D. Woods
,
Abraham P. Punnen
,
Tamon Stephen
ArXiv
2015
Corpus ID: 5854962
The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs…
Expand
2009
2009
A selection of useful theoretical tools for the design and analysis of optimization heuristics
G. Gutin
,
Daniel Karapetyan
Memetic Computing
2009
Corpus ID: 3489525
An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a…
Expand
Review
2007
Review
2007
Exponential Neighborhoods and Domination Analysis for the TSP
G. Gutin
,
A. Yeo
,
A. Zverovitch
2007
Corpus ID: 11263086
In this section, we overview the main results on the topics of this chapter and give basic terminology and notation used…
Expand
Highly Cited
2003
Highly Cited
2003
Transformations of generalized ATSP into ATSP
D. Ben-Arieh
,
G. Gutin
,
M. Penn
,
A. Yeo
,
A. Zverovich
Operations Research Letters
2003
Corpus ID: 7892487
Highly Cited
2003
Highly Cited
2003
TSP Heuristics: Domination Analysis and Complexity
Abraham P. Punnen
,
F. Margot
,
S. N. Kabadi
Algorithmica
2003
Corpus ID: 5540305
We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete graph Kn produce a solution…
Expand
2001
2001
TSP tour domination and Hamilton cycle decompositions of regular digraphs
G. Gutin
,
A. Yeo
Operations Research Letters
2001
Corpus ID: 3495926
Highly Cited
2001
Highly Cited
2001
Structure and trophic organization of subtidal fish assemblages on the northern Chilean coast: the effect of habitat complexity
A. Angel
,
F. P. Ojeda
2001
Corpus ID: 55941311
A series of local factors such as substrate structure, presence or absence of kelp forests and environmental variables play an…
Expand
Review
1986
Review
1986
Factoring Algorithms for Computing K-Terminal Network Reliability
R. K. Wood
IEEE Transactions on Reliability
1986
Corpus ID: 15675039
Let GK denote a graph G whose edges can fail and with a set K ¿ V specified. Edge failures are independent and have known…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE