Esta página mostra as diferenças entre as duas revisões da página.
Ambos os lados da revisão anterior Revisão anterior Próxima revisão | Revisão anterior | ||
metalibrary [2013/11/29 16:39] marcus |
metalibrary [2018/05/14 22:30] (Actual) |
||
---|---|---|---|
Linha 2: | Linha 2: | ||
* [[http://steinlib.zib.de//steinlib.php|Steiner trees]] | * [[http://steinlib.zib.de//steinlib.php|Steiner trees]] | ||
- | * [[http://www.wiwi.uni-jena.de/Entscheidung/binpp|Bin packing]] | + | * [[https://www2.wiwi.uni-jena.de/Entscheidung/binpp/index.htm|Bin packing]] |
* [[http://www.seas.upenn.edu/qaplib|Quadratic Assignment Problem]] | * [[http://www.seas.upenn.edu/qaplib|Quadratic Assignment Problem]] | ||
- | * Capacitated vehicle routing problem: [[http://neo.lcc.uma.es/radi-aeb/WebVRP|VRP web]] and [[http://www.or.deis.unibo.it/research_pages/ORinstances/VRPLIB/VRPLIB.html|VRPlib]] | + | * Vehicle routing problems: [[http://www.bernabe.dorronsoro.es/vrp|VRP web]], [[hhttp://or.dei.unibo.it/library/vrplib-vehicle-routing-problem-library|VRPlib]], and [[http://neumann.hec.ca/chairedistributique/data|HEC]] |
* [[http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html|Asymmetric traveling salesman]] | * [[http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html|Asymmetric traveling salesman]] | ||
* [[http://staffweb.cms.gre.ac.uk/~wc06/partition|Graph partitioning]] | * [[http://staffweb.cms.gre.ac.uk/~wc06/partition|Graph partitioning]] | ||
Linha 14: | Linha 14: | ||
* [[http://ttplib.zib.de|Train time-tabling]] | * [[http://ttplib.zib.de|Train time-tabling]] | ||
* [[http://sndlib.zib.de|Survivable network design]] | * [[http://sndlib.zib.de|Survivable network design]] | ||
- | * [[http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/set-benchmarks.htm|Set cover]] | + | * [[http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/set-benchmarks.htm|Set cover]], também [[http://people.brunel.ac.uk/~mastjjb/jeb/orlib/scpinfo.html|aqui]] |
* [[http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm|Maximum independent set and minimum vertex cover]] | * [[http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm|Maximum independent set and minimum vertex cover]] | ||
* [[http://soa.iti.es/instancias-de-problemas|Scheduling problems]] | * [[http://soa.iti.es/instancias-de-problemas|Scheduling problems]] | ||
Linha 25: | Linha 25: | ||
* [[http://plaza.ufl.edu/shylo/TA.html|Taillard instances]] for job shop scheduling. | * [[http://plaza.ufl.edu/shylo/TA.html|Taillard instances]] for job shop scheduling. | ||
* [[http://www.om-db.wi.tum.de/psplib/main.html|Project scheduling library]]. | * [[http://www.om-db.wi.tum.de/psplib/main.html|Project scheduling library]]. | ||
- | * [[http://www.mech.kuleuven.be/en/cib/op|Orienteering]]. | + | * [[http://www.mech.kuleuven.be/en/cib/op|Orienteering]], [[https://unicen.smu.edu.sg/oplib-orienteering-problem-library|OPLIB – The Orienteering Problem Library]] |
* [[http://math.nsc.ru/AP/benchmarks/english.html|Discrete location problems benchmarks library]] | * [[http://math.nsc.ru/AP/benchmarks/english.html|Discrete location problems benchmarks library]] | ||
* [[http://www.cs.nott.ac.uk/~tec/NRP/|Employee Scheduling Benchmark Data Sets]] | * [[http://www.cs.nott.ac.uk/~tec/NRP/|Employee Scheduling Benchmark Data Sets]] | ||
* [[http://www.ozone.ri.cmu.edu/benchmarks.html|Weighted Tardiness Sequencing with Sequence-Dependent Setups]] | * [[http://www.ozone.ri.cmu.edu/benchmarks.html|Weighted Tardiness Sequencing with Sequence-Dependent Setups]] | ||
- | * [[http://people.brunel.ac.uk/~mastjjb/jeb/info.html|Beasley's OR Lilbrary]] | + | * [[http://people.brunel.ac.uk/~mastjjb/jeb/info.html|Beasley's OR Library]] |
* [[http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html|Shop scheduling]] | * [[http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html|Shop scheduling]] | ||
* [[http://www.lifl.fr/~liefooga/benchmarks|Bi-criteria benchmarks for flow-shop scheduling problems with uncertain processing times]] | * [[http://www.lifl.fr/~liefooga/benchmarks|Bi-criteria benchmarks for flow-shop scheduling problems with uncertain processing times]] | ||
* [[https://www.informs.org/Community/RAS/Problem-Solving-Competition|Problem set from Railway applications]] | * [[https://www.informs.org/Community/RAS/Problem-Solving-Competition|Problem set from Railway applications]] | ||
- | * [[http://www.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib|Uncapacitated facility location]] | + | * [[http://resources.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib|Uncapacitated facility location]] |
+ | * [[http://www.lsi.upc.es/~jpetit/MinLA/Experiments/jpetit-extra.tar.gz|Linear arrangement (Petit)]] | ||
+ | * [[http://www.optsicom.es/lolib|Linear ordering]] | ||
+ | * [[http://benchmark.gent.cs.kuleuven.be/tup/en|Traveling Umpire Problem]] | ||
+ | * [[http://hhperez.webs.ull.es/PDsite|Pickup and delivery problems]] | ||
+ | * [[http://www.prism.uvsq.fr/~blec/index.php?p=./rech/oc&lang=en|Bin packing with fragmentable items, Vehicle2Grid Optimization, Crew Scheduling Problem, 3D Quadratic Assignment Problem, Quadratic Assignment Problem, Vehicle Routing Problem]] | ||
+ | * [[http://www.minlplib.org|MINLPLib: A Library of Mixed-Integer and Continuous Nonlinear Programming Instances]] | ||
+ | * [[https://voptsolver.github.io/vOptLib|vOptLib: Library of numerical instances for MultiObjective Linear Optimization problems]] | ||
+ | * [[https://www2.isye.gatech.edu/~sahmed/siplib/sslp/sslp.html|Stochastic server location]] | ||
+ | * [[https://mirplib.scl.gatech.edu|MIRPLib – A library of maritime inventory routing problem instances]] | ||
+ | * [[http://www.ic.unicamp.br/~cid/Problem-instances/Wireless-Localization|NWLPLIB - Wireless Localization Problem Library]] | ||
+ | * [[https://homepage.univie.ac.at/ivana.ljubic/research/pcstp|The Prize-Collecting Steiner Tree Problem]] | ||
+ | * [[http://mansci-web.uai.cl/minelib|Minelib: A library of open-pit mining problems]] | ||
+ | * [[http://cedric.cnam.fr/~lamberta/Library/iqcp_miqcp.html|General mixed-integer quadratically constrained problem instances]] | ||
+ | * [[http://fap.zib.de/problems/|FAP web - A website about Frequency Assignment Problems]] | ||
+ | * [[http://www.coga.tu-berlin.de/v_menue/download_media/clrlib|Capacitated Location Routing Instance Library (CLRlib)]] | ||
+ | * [[http://basblsolver.github.io/BASBLib|BASBLib - A Library of Bilevel Test Problems]] | ||
+ | | ||
<html> | <html> | ||
<a href="http://www2.clustrmaps.com/counter/maps.php?url=http://www.inf.ufrgs.br/~mrpritt" id="clustrMapsLink"><img width=1 src="http://www2.clustrmaps.com/counter/index2.php?url=http://www.inf.ufrgs.br/~mrpritt" style="border:1px solid;" alt="Locations of visitors to this page" title="Locations of visitors to this page" id="clustrMapsImg" onError="this.onError=null; this.src='http://clustrmaps.com/images/clustrmaps-back-soon.jpg'; document.getElementById('clustrMapsLink').href='http://clustrmaps.com'" /> | <a href="http://www2.clustrmaps.com/counter/maps.php?url=http://www.inf.ufrgs.br/~mrpritt" id="clustrMapsLink"><img width=1 src="http://www2.clustrmaps.com/counter/index2.php?url=http://www.inf.ufrgs.br/~mrpritt" style="border:1px solid;" alt="Locations of visitors to this page" title="Locations of visitors to this page" id="clustrMapsImg" onError="this.onError=null; this.src='http://clustrmaps.com/images/clustrmaps-back-soon.jpg'; document.getElementById('clustrMapsLink').href='http://clustrmaps.com'" /> |