Viquipèdia

Concorde TSP Solver: diferència entre les revisions

Exploració interactiva de l'historial
← Edició anteriorEdició següent →
Contingut suprimit Contingut afegit
VisualWikitext
Robot catalanitza noms i paràmetres de plantilles
Cap resum de modificació
Línia 1:
El '''Concorde TSP Solver''' és un [[programa]] per solucionar el [[problema del viatjant de comerç]]. &nbsp;Va ser escrit per David Applegate, Robert E. Bixby, [[Vašek Chvátal]], i [[William J. Cook|William]] J. [[William J. Cook|Cuiner]], en [[ANSI C]], i es troba lliurement disponible per ús acadèmic. Concorde ha estat aplicat a problemes de [[mapatge de gens]], [[predicció de funció de la proteïna]], [[encaminament de vehicles]], conversió d'[[imatges vectorials]] 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.<ref>{{citation
 
Concorde ha estat aplicat a problemes de [[Gene mapping|mapatge de gens]], [[Protein function prediction|predicció de funció de la proteïna]], [[Vehicle routing problem|encaminament de vehicles]], conversió d'imatges vectorials 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.<ref>{{harvtxt|Hitte|Lorentzen|Guyon|Kim|2003}}.</ref><ref>{{harvtxt|Johnson|Liu|2006}}.</ref><ref>{{harvtxt|Applegate|Cook|Dash|Rohe|2002}}.</ref><ref>{{harvtxt|Bosch|Herman|2004}}.</ref><ref>{{harvtxt|Gutin|Jakubowicz|Ronen|Zverovitch|2005}}</ref><ref>{{harvtxt|Aldous|Percus|2003}}.</ref>
 
== Notes ==
{{referències}}
 
==Bibliografia==
{{refbegin|2}}
*{{citation
| last1 = Aldous | first1 = David
| last2 = Percus | first2 = Allon G.
| doi = 10.1073/pnas.1635191100
| issue = 20
| journal = PROC. Nat. Acad. Sci. USA
| pages = 11211–11215
| title = Scaling and universality in continuous length combinatorial optimization
| volume = 100
| year = 2003
| pmid = 14504403
| pmc = 208736| bibcode = 2003PNAS..10011211A
}}.
*{{citation
| last1 = Applegate | first1 = David
| last2 = Cook | first2 = William
| last3 = Dash | first3 = Sanjeeb
| last4 = Rohe | first4 = André
| doi = 10.1287/ijoc.14.2.132.118
| issue = 2
| journal = INFORMS Journal on Computing
| pages = 132–143
| title = Solution of a min-max vehicle routing problem
| volume = 14
| year = 2002}}.
*{{citation
| last1 = Bosch | first1 = Robert
| last2 = Herman | first2 = Adrianne
| doi = 10.1016/j.orl.2003.10.001
| issue = 4
| journal = Operations Research Letters
| pages = 302–303
| title = Continuous line drawings via the traveling salesman problem
| url = http://www.oberlin.edu/math/faculty/bosch/cld.pdf
| volume = 32
| year = 2004}}.
*{{citation
| last1 = Gutin | first1 = Gregory
| last2 = Jakubowicz | first2 = Helmut
| last3 = Ronen | first3 = Shuki
| last4 = Zverovitch | first4 = Alexei
| journal = Communications in DQM
| pages = 13–20
| title = Seismic vessel problem
| url = http://www.cs.rhul.ac.uk/home/gutin/paperstsp/svp5.pdf
| volume = 8
| year = 2005}}.
*{{citation
| last1 = Hahsler | first1 = Michael
| last2 = Hornik | first2 = Kurt
| issue = 2
| journal = Journal of Statistical Software
| pages = 1–21
| title = TSP – Infrastructure for the Traveling Salesperson Problem
| url = http://www.jstatsoft.org/v23/i02
| volume = 23
| year = 2007}}.
*{{citation
| last1 = Hitte | first1 = C.
| last2 = Lorentzen | first2 = T. D.
Linha 89 ⟶ 23:
| year = 2003
| pmid = 12692156| display-authors = 8
}}</ref><ref>{{citation
}}.
*{{citation
| last1 = Johnson | first1 = Olin
| last2 = Liu | first2 = Jing
| doi = 10.1186/1751-0473-1-3
| journal = Source Code for Biology and Medicine
| page = 3 | title = A traveling salesman approach for predicting protein functions
| page = 3
| volume = 1 | year = 2006 | pmid = 17147783 | pmc = 1636333}}</ref><ref>{{citation
| title = A traveling salesman approach for predicting protein functions
| last1 = Applegate | first1 = David
| volume = 1
| last2 = Cook | first2 = William
| year = 2006
| last3 = Dash | first3 = Sanjeeb
| pmid = 17147783
| last4 = Rohe | first4 = André
| pmc = 1636333}}.
| doi = 10.1287/ijoc.14.2.132.118
*{{citation
| issue = 2 | journal = INFORMS Journal on Computing
| pages = 132–143
| title = Solution of a min-max vehicle routing problem
| volume = 14 | year = 2002}}</ref><ref>{{citation
| last1 = Bosch | first1 = Robert
| last2 = Herman | first2 = Adrianne
| doi = 10.1016/j.orl.2003.10.001
| issue = 4 | journal = Operations Research Letters
| pages = 302–303
| title = Continuous line drawings via the traveling salesman problem
| url = http://www.oberlin.edu/math/faculty/bosch/cld.pdf
| volume = 32 | year = 2004}}</ref><ref>{{citation
| last1 = Gutin | first1 = Gregory
| last2 = Jakubowicz | first2 = Helmut
| last3 = Ronen | first3 = Shuki
| last4 = Zverovitch | first4 = Alexei
| journal = Communications in DQM
| pages = 13–20
| title = Seismic vessel problem
| url = http://www.cs.rhul.ac.uk/home/gutin/paperstsp/svp5.pdf
| volume = 8 | year = 2005}}</ref><ref><ref>{{citation | last1 = Aldous | first1 = David
| last2 = Percus | first2 = Allon G.
| doi = 10.1073/pnas.1635191100
| issue = 20 | journal = PROC. Nat. Acad. Sci. USA
| pages = 11211–11215
| title = Scaling and universality in continuous length combinatorial optimization
| volume = 100
| year = 2003
| pmid = 14504403
| pmc = 208736| bibcode = 2003PNAS..10011211A
}}</ref></ref>
 
== Notes ==
{{Referències|2}}
 
==Bibliografia==
{{refbegin|2}}
* {{citation
| last1 = Mulder | first1 = Samuel A.
| last2 = Wunsch | first2 = Donald C., II
Linha 111 ⟶ 82:
| volume = 16
| year = 2003
| pmid = 12850040}}.
* {{citation
| last1 = Hahsler | first1 = Michael
| last2 = Hornik | first2 = Kurt
| issue = 2 | journal = Journal of Statistical Software
| pages = 1–21 | title = TSP – Infrastructure for the Traveling Salesperson Problem
| url = http://www.jstatsoft.org/v23/i02
| volume = 23 | year = 2007}}
{{refend}}
 
== Enllaços externs ==
*[http://www.math.uwaterloo.ca/tsp/concorde/ Lloc web del Concorde] {{en}}
*[http://neos.mcs.anl.gov/neos/solvers/co:concorde/TSP.html Online access to Concorde solver] a [[Argonne National Laboratories]] {{en}}
 
{{orfe}}
{{esborrany d'informàtica}}
 
[[Categoria:Programari d'optimització matemàtica]]
Obtingut de «https://ca.wikipedia.org/wiki/Concorde_TSP_Solver»