Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Corn is one of the strategic food commodities in Indonesia which is currently widely used as animal feed ingredient. But the… 
Review
2018
Review
2018
The problem of Staffing and Scheduling a Software Project (SSSP), where we consider Human Resource Allocation (HRA) to minimize… 
2014
2014
We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean Quadratic… 
Review
2012
Review
2012
Filariasis is one of the vector born diseases which is still a problem of public health in Indonesia. The health effects are… 
2009
2009
An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a… 
2007
2007
In this paper we introduce three greedy algorithms for the traveling salesman problem. These algorithms are unique in that they… 
Review
2004
Review
2004
In the recently published book on the Traveling Salesman Problem, half of Chapter 6 [18] is devoted to domination analysis (DA… 
Review
1999
Review
1999
Non-Euclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the… 
Review
1986
Review
1986
Let GK denote a graph G whose edges can fail and with a set K ¿ V specified. Edge failures are independent and have known…