The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Para problemas de otimização combinatória NP-difíceis, algoritmos de aproximação com alto desempenho têm sido propostos. Em muitos destes algoritmos, técnicas de programação matemática têm sido utilizadas e provaram ser muito úteis. Nesta pesquisa, apresentamos técnicas recentes de programação matemática, bem como técnicas fundamentais clássicas, mostrando como essas técnicas são usadas no projeto de algoritmos de aproximação de alta qualidade para problemas de otimização combinatória NP-difíceis.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Takao ASANO, Kenichiro IWAMA, Hideyuki TAKADA, Yoshiko YAMASHITA, "Designing High-Quality Approximation Algorithms for Combinatorial Optimization Problems" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 462-479, March 2000, doi: .
Abstract: For NP-hard combinatorial optimization problems, approximation algorithms with high performances have been proposed. In many of these algorithms, mathematical programming techniques have been used and proved to be very useful. In this survey, we present recent mathematical programming techniques as well as classic fundamental techniques, by showing how these techniques are used in designing high-quality approximation algorithms for NP-hard combinatorial optimization problems.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_462/_p
Copiar
@ARTICLE{e83-d_3_462,
author={Takao ASANO, Kenichiro IWAMA, Hideyuki TAKADA, Yoshiko YAMASHITA, },
journal={IEICE TRANSACTIONS on Information},
title={Designing High-Quality Approximation Algorithms for Combinatorial Optimization Problems},
year={2000},
volume={E83-D},
number={3},
pages={462-479},
abstract={For NP-hard combinatorial optimization problems, approximation algorithms with high performances have been proposed. In many of these algorithms, mathematical programming techniques have been used and proved to be very useful. In this survey, we present recent mathematical programming techniques as well as classic fundamental techniques, by showing how these techniques are used in designing high-quality approximation algorithms for NP-hard combinatorial optimization problems.},
keywords={},
doi={},
ISSN={},
month={March},}
Copiar
TY - JOUR
TI - Designing High-Quality Approximation Algorithms for Combinatorial Optimization Problems
T2 - IEICE TRANSACTIONS on Information
SP - 462
EP - 479
AU - Takao ASANO
AU - Kenichiro IWAMA
AU - Hideyuki TAKADA
AU - Yoshiko YAMASHITA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - For NP-hard combinatorial optimization problems, approximation algorithms with high performances have been proposed. In many of these algorithms, mathematical programming techniques have been used and proved to be very useful. In this survey, we present recent mathematical programming techniques as well as classic fundamental techniques, by showing how these techniques are used in designing high-quality approximation algorithms for NP-hard combinatorial optimization problems.
ER -