| http://dbpedia.org/ontology/abstract
|
Concorde TSP Solver és un programa per sol … Concorde TSP Solver és un programa per solucionar el problema del viatjant de comerç. Va ser escrit per David Applegate, Robert E. Bixby, , i J. , en ANSI C, i es troba lliurement disponible per ús acadèmic. Concorde ha estat aplicat a problemes de , , , conversió d' a dibuixos de línia contínua, planificació de moviments de vaixell per estudis sísmics, i estudi de propietats d'escalatge de problemes d'optimització combinatòria. de problemes d'optimització combinatòria.
, The Concorde TSP Solver is a program for s … The Concorde TSP Solver is a program for solving the travelling salesman problem. It was written by David Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook, in ANSI C, and is freely available for academic use. Concorde has been applied to problems of gene mapping, protein function prediction, vehicle routing, conversion of bitmap images to continuous line drawings, scheduling ship movements for seismic surveys, and in studying the scaling properties of combinatorial optimization problems. According to , Concorde “is widely regarded as the fastest TSP solver, for large instances, currently in existence.” In 2001, Concorde won a 5000 guilder prize from CMG for solving a vehicle routing problem the company had posed in 1996.ing problem the company had posed in 1996.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.cs.rhul.ac.uk/home/gutin/paperstsp/svp5.pdf +
, http://www.math.uwaterloo.ca/tsp/concorde/ +
, https://neos-server.org/neos/solvers/co:concorde/TSP.html +
, http://www.oberlin.edu/math/faculty/bosch/cld.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
16645361
|
| http://dbpedia.org/ontology/wikiPageLength
|
4550
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1040649730
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Dutch_guilder +
, http://dbpedia.org/resource/ANSI_C +
, http://dbpedia.org/resource/Protein_function_prediction +
, http://dbpedia.org/resource/William_J._Cook +
, http://dbpedia.org/resource/Category:Mathematical_optimization_software +
, http://dbpedia.org/resource/Va%C5%A1ek_Chv%C3%A1tal +
, http://dbpedia.org/resource/Robert_E._Bixby +
, http://dbpedia.org/resource/Arizona_State_University +
, http://dbpedia.org/resource/CMG_%28company%29 +
, http://dbpedia.org/resource/Travelling_salesman_problem +
, http://dbpedia.org/resource/David_Applegate +
, http://dbpedia.org/resource/Gene_mapping +
, http://dbpedia.org/resource/Category:Travelling_salesman_problem +
, http://dbpedia.org/resource/Vehicle_routing_problem +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Refbegin +
, http://dbpedia.org/resource/Template:Refend +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Harvtxt +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Mathematical_optimization_software +
, http://dbpedia.org/resource/Category:Travelling_salesman_problem +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Program +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Concorde_TSP_Solver?oldid=1040649730&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Concorde_TSP_Solver +
|
| owl:sameAs |
http://dbpedia.org/resource/Concorde_TSP_Solver +
, http://www.wikidata.org/entity/Q5158938 +
, http://ca.dbpedia.org/resource/Concorde_TSP_Solver +
, http://rdf.freebase.com/ns/m.03yjd7x +
, https://global.dbpedia.org/id/4hmUA +
|
| rdf:type |
http://dbpedia.org/ontology/Work +
|
| rdfs:comment |
Concorde TSP Solver és un programa per sol … Concorde TSP Solver és un programa per solucionar el problema del viatjant de comerç. Va ser escrit per David Applegate, Robert E. Bixby, , i J. , en ANSI C, i es troba lliurement disponible per ús acadèmic. Concorde ha estat aplicat a problemes de , , , conversió d' a dibuixos de línia contínua, planificació de moviments de vaixell per estudis sísmics, i estudi de propietats d'escalatge de problemes d'optimització combinatòria. de problemes d'optimització combinatòria.
, The Concorde TSP Solver is a program for s … The Concorde TSP Solver is a program for solving the travelling salesman problem. It was written by David Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook, in ANSI C, and is freely available for academic use. Concorde has been applied to problems of gene mapping, protein function prediction, vehicle routing, conversion of bitmap images to continuous line drawings, scheduling ship movements for seismic surveys, and in studying the scaling properties of combinatorial optimization problems.es of combinatorial optimization problems.
|
| rdfs:label |
Concorde TSP Solver
|
