The concept of reducibility, the chosing of measures of approximate solutions and the evaluation functions for approximate algorithms are investigated in the present paper.

Towards a general principle of evaluation for approximate algorithms

1979

Abstract

The concept of reducibility, the chosing of measures of approximate solutions and the evaluation functions for approximate algorithms are investigated in the present paper.
1979
Istituto di Scienze Applicate e Sistemi Intelligenti "Eduardo Caianiello" - ISASI
Combinatorial problems. Approximate algorithms. Evaluation of solution.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/313506
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact