{"id":"https://openalex.org/W2120470208","doi":"https://doi.org/10.1007/s11590-006-0031-4","title":"TTT plots: a perl program to create time-to-target plots","display_name":"TTT plots: a perl program to create time-to-target plots","publication_year":2006,"publication_date":"2006-10-30","ids":{"openalex":"https://openalex.org/W2120470208","doi":"https://doi.org/10.1007/s11590-006-0031-4","mag":"2120470208"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-006-0031-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-006-0031-4","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001009349","display_name":"Renata M. Aiex","orcid":null},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]},{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]}],"countries":["BR","US"],"is_corresponding":false,"raw_author_name":"Renata M. Aiex","raw_affiliation_strings":["Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ, 22451, Brazil","Catholic Univ. of Rio de Janeiro"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ, 22451, Brazil","institution_ids":["https://openalex.org/I2699952"]},{"raw_affiliation_string":"Catholic Univ. of Rio de Janeiro","institution_ids":["https://openalex.org/I84470341"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mauricio G. C. Resende","raw_affiliation_strings":["Algorithms and Optimization Research Department, AT&T Labs Research, 180 Park Avenue, Room C241, Florham Park, NJ, 07932-0971, USA","AT&T Labs--Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Optimization Research Department, AT&T Labs Research, 180 Park Avenue, Room C241, Florham Park, NJ, 07932-0971, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs--Research","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032142322","display_name":"Celso C. Ribeiro","orcid":"https://orcid.org/0000-0002-9478-2351"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Celso C. Ribeiro","raw_affiliation_strings":["Department of Computer Science, Universidade Federal Fluminense, Rua Passo da P\u00e1tria, 156, Niter\u00f3i, RJ, 24210-240, Brazil","universidade Federal Fluminense"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal Fluminense, Rua Passo da P\u00e1tria, 156, Niter\u00f3i, RJ, 24210-240, Brazil","institution_ids":["https://openalex.org/I161127581"]},{"raw_affiliation_string":"universidade Federal Fluminense","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029261812"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.1957,"has_fulltext":false,"cited_by_count":211,"citation_normalized_percentile":{"value":0.93934286,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"1","issue":"4","first_page":"355","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/perl","display_name":"Perl","score":0.9396543502807617},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7921539545059204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6704148054122925},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6651778221130371},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.615595281124115},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6050050854682922},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.5751252770423889},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5512307286262512},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5340297222137451},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5131807923316956},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.4799764156341553},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.47153836488723755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4433954060077667},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.44154059886932373},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4194222092628479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4002648591995239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27839913964271545},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24053847789764404},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20601892471313477}],"concepts":[{"id":"https://openalex.org/C2777002779","wikidata":"https://www.wikidata.org/wiki/Q42478","display_name":"Perl","level":2,"score":0.9396543502807617},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7921539545059204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6704148054122925},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6651778221130371},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.615595281124115},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6050050854682922},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.5751252770423889},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5512307286262512},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5340297222137451},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5131807923316956},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.4799764156341553},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.47153836488723755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4433954060077667},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.44154059886932373},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4194222092628479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4002648591995239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27839913964271545},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24053847789764404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20601892471313477},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11590-006-0031-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-006-0031-4","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.8831","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mgcr/doc/tttplots.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W68587524","https://openalex.org/W109111717","https://openalex.org/W195054332","https://openalex.org/W578916329","https://openalex.org/W595785050","https://openalex.org/W1484564260","https://openalex.org/W1494865762","https://openalex.org/W1497380692","https://openalex.org/W1506751304","https://openalex.org/W1511014919","https://openalex.org/W1516130043","https://openalex.org/W1519526968","https://openalex.org/W1520210297","https://openalex.org/W1520775587","https://openalex.org/W1521726209","https://openalex.org/W1546325545","https://openalex.org/W1562861155","https://openalex.org/W1563291122","https://openalex.org/W1574261054","https://openalex.org/W1581599232","https://openalex.org/W1592391206","https://openalex.org/W1593552491","https://openalex.org/W1757657959","https://openalex.org/W1933569933","https://openalex.org/W1971700807","https://openalex.org/W1987703212","https://openalex.org/W1991068820","https://openalex.org/W1999565574","https://openalex.org/W2017848214","https://openalex.org/W2024110228","https://openalex.org/W2025320861","https://openalex.org/W2038806264","https://openalex.org/W2062596410","https://openalex.org/W2072651496","https://openalex.org/W2079641336","https://openalex.org/W2090275183","https://openalex.org/W2101747335","https://openalex.org/W2107465979","https://openalex.org/W2117942072","https://openalex.org/W2126927016","https://openalex.org/W2129526759","https://openalex.org/W2137004940","https://openalex.org/W2142691991","https://openalex.org/W2148948822","https://openalex.org/W2151094870","https://openalex.org/W2154682258","https://openalex.org/W2156708389","https://openalex.org/W2164824749","https://openalex.org/W2165372647","https://openalex.org/W2801830100","https://openalex.org/W2997776631","https://openalex.org/W4251801412"],"related_works":["https://openalex.org/W1245780190","https://openalex.org/W2123829500","https://openalex.org/W90886653","https://openalex.org/W1548986920","https://openalex.org/W4252370918","https://openalex.org/W2045456468","https://openalex.org/W3003450854","https://openalex.org/W1533229056","https://openalex.org/W2114712485","https://openalex.org/W2492630225"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":16}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}
