Domination Analysis of Combinatorial Optimization Problems.

Gutin, G., & Yeo, A. (2003). Domination Analysis of Combinatorial Optimization Problems. Discrete Applied Mathematics, 513-520.

Type

Journal article

Intellectual base

Primary research

Year

2003

Pages

513-520

ISSN

0166-218X

DOI

10.1016/s0166-218x(03)00359-7

DOI registrant

Elsevier

Link

https://www.sciencedirect.com/science/article/pii/S0166218X03003597

Cited by

1 citation across 1 artifact.

Domain-specific

• Domination Analysis
  • These papers support transfer of the analysis question, not transfer of `(n−1)!` tour counting or a TSP algorithm to assignment problems.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:51f766f6d335 · see in the full table