Found 1,021 Documents (Results 1–100)
NeuroPrim: an attention-based model for solving NP-hard spanning tree problems. (English) Zbl 07873878
Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions. (English) Zbl 07865022
MSC:
90Bxx
A tree search algorithm for uncertainty-considered consecutive discharging and loading operations between ship and offshore platform. (English) Zbl 07864435
MSC:
90Bxx
Energy efficient sorting, selection and searching. (English) Zbl 07858793
MSC:
68P10
Collaborative cost multi-agent decision-making algorithm with factored-value Monte Carlo tree search and max-plus. (English) Zbl 07865478
Robust data sampling in machine learning: a game-theoretic framework for training and validation data selection. (English) Zbl 07865416
Simulation-based search. (English) Zbl 1535.68319
Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 6. Sections 12–14. Berlin: European Mathematical Society (EMS). 4800-4819 (2023).
Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring. (English) Zbl 07787616
Pérez Cáceres, Leslie (ed.) et al., Evolutionary computation in combinatorial optimization. 23rd European conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12–14, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13987, 98-113 (2023).
Energy efficient sorting, selection and searching. (English) Zbl 07770291
Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 179-190 (2023).
MSC:
68Wxx
Shortest journeys in directed temporal graphs. (English) Zbl 1533.68218
MSC:
68R10
General variable neighborhood search for the minimum stretch spanning tree problem. (English) Zbl 1534.90174
MSC:
90C35
Random plane increasing trees: asymptotic enumeration of vertices by distance from leaves. (English) Zbl 1522.05416
Monte Carlo tree search for automatic differential characteristics search: application to SPECK. (English) Zbl 1519.94048
Isobe, Takanori (ed.) et al., Progress in cryptology – INDOCRYPT 2022. 23rd international conference on cryptology in India, Kolkata, India, December 11–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13774, 373-397 (2023).
Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows. (English) Zbl 07704066
Temporal logic explanations for dynamic decision systems using anchors and Monte Carlo tree search. (English) Zbl 07702936
MSC:
68Txx
Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm. (English) Zbl 1512.90238
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. (English) Zbl 1520.90177
Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm. (English) Zbl 1502.90149
A tree search heuristic for the resource constrained project scheduling problem with transfer times. (English) Zbl 1541.90164
Simple order-isomorphic matching index with expected compact space. (English) Zbl 07911127
Bae, Sang Won (ed.) et al., 33rd international symposium on algorithms and computation (ISAAC 2022), Seoul, Korea, December 19–21, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 248, Article 61, 17 p. (2022).
MSC:
68Wxx
An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions. (English) Zbl 07842467
Bannai, Hideo (ed.) et al., 33rd annual symposium on combinatorial pattern matching, CPM 2022, Prague, Czech Republic, June 27–29, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 223, Article 6, 11 p. (2022).
MSC:
68W32
Allocation of phasor measurement unit using an admissible searching-based algorithm A-star and binary search tree for full interconnected power network observability. (English) Zbl 1531.93034
Compaction for two models of logarithmic-depth trees: analysis and experiments. (English) Zbl 1522.05031
Monte Carlo tree search for priced timed automata. (English) Zbl 1522.68273
Ábrahám, Erika (ed.) et al., Quantitative evaluation of systems. 19th international conference, QEST 2022, Warsaw, Poland, September 12–16, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13479, 381-398 (2022).
Linearizing partial search orders. (English) Zbl 07682427
Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 425-438 (2022).
MSC:
68R10
Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector. (English) Zbl 1505.90134
MSC:
90C35
Exact algorithms for finding constrained minimum spanning trees. (English) Zbl 1502.90185
MSC:
90C35
Matching and scheduling of student-company-talks for a university it-speed dating event. (English) Zbl 1495.90064
On Monte Carlo tree search for weighted vertex coloring. (English) Zbl 1499.68273
Pérez Cáceres, Leslie (ed.) et al., Evolutionary computation in combinatorial optimization. 22nd European conference, EvoCOP 2022, held as part of EvoStar 2022, Madrid, Spain, April 20–22, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13222, 1-16 (2022).
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming. (English) Zbl 1496.90033
An optimal computing budget allocation tree policy for Monte Carlo tree search. (English) Zbl 07564894
Fault tolerant depth first search in undirected graphs: simple yet efficient. (English) Zbl 1502.68206
Reviewer: Guillaume Fertin (Nantes)
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. (English) Zbl 1520.90180
Computer search for graceful labeling: a survey. (English) Zbl 1487.05228
MSC:
05C78
Memory-limited model-based diagnosis. (English) Zbl 07505980
MSC:
68Txx
Learning and planning in partially observable environments without prior domain knowledge. (English) Zbl 07478943
An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search. (English) Zbl 07768633
MSC:
90-XX
Hypersuccinct trees – new universal tree source codes for optimal compressed tree data structures and range minima. (English) Zbl 07740925
Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 70, 18 p. (2021).
MSC:
68Wxx
Efficient privacy-preserving variable-length substring match for genome sequence. (English) Zbl 1519.92168
Carbone, Alessandra (ed.) et al., 21st international workshop on algorithms in bioinformatics, WABI 2021, August 2–4, 2021, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 201, Article 2, 23 p. (2021).
Directed width parameters on semicomplete digraphs. (English) Zbl 07550556
Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 615-628 (2021).
Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm. (English) Zbl 07550539
Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 389-399 (2021).
Extracting the sparse longest common prefix array from the suffix binary search tree. (English) Zbl 07542418
Lecroq, Thierry (ed.) et al., String processing and information retrieval. 28th international symposium, SPIRE 2021, Lille, France, October 4–6, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12944, 143-150 (2021).
On minimum generalized Manhattan connections. (English) Zbl 07498670
Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 85-100 (2021).
Effective hybrid system falsification using Monte Carlo tree search guided by QB-robustness. (English) Zbl 1493.68227
Silva, Alexandra (ed.) et al., Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20–23, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12759, 595-618 (2021).
Safe learning for near-optimal scheduling. (English) Zbl 1491.68151
Abate, Alessandro (ed.) et al., Quantitative evaluation of systems. 18th international conference, QEST 2021, Paris, France, August 23–27, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12846, 235-254 (2021).
Zip trees. (English) Zbl 07479304
Probabilistic analysis of vantage point trees. (English) Zbl 1482.60033
Reviewer: Fraser Daly (Edinburgh)
Split trees – a unifying model for many important random trees of logarithmic height: a brief survey. (English) Zbl 1484.68057
Lindblad, Joakim (ed.) et al., Discrete geometry and mathematical morphology. First international joint conference, DGMM 2021, Uppsala, Sweden, May 24–27, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12708, 20-57 (2021).
Random projection-based auxiliary information can improve tree-based nearest neighbor search. (English) Zbl 1475.68103
A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks. (English) Zbl 1475.92117
Concurrent linearizable nearest neighbour search in LockFree-kD-tree. (English) Zbl 1514.68042
MSC:
68P05
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. (English) Zbl 07405967
Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 260-271 (2021).
MSC:
68Wxx
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. (English) Zbl 1473.90145
MSC:
90C27
Metric dimension of critical Galton-Watson trees and linear preferential attachment trees. (English) Zbl 1466.05056
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem. (English) Zbl 1487.90561
The cardinality constrained inverse center location problems on tree networks with edge length augmentation. (English) Zbl 1501.90043
Improving SAT solving using Monte Carlo tree search-based clause learning. (English) Zbl 1528.68361
Drechsler, Rolf (ed.) et al., Advanced Boolean techniques. Selected papers from the 13th international workshop on Boolean problems, Bremen, Germany, September 19–21, 2018. Cham: Springer. 107-133 (2020).
MSC:
68T20
A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem. (English) Zbl 07767490
MSC:
90-XX
New binary search tree bounds via geometric inversions. (English) Zbl 07651167
Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 28, 16 p. (2020).
MSC:
68Wxx
Lower bounds and approximation algorithms for search space sizes in contraction hierarchies. (English) Zbl 07651159
Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 20, 14 p. (2020).
MSC:
68Wxx
Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH. (English) Zbl 07636036
Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 447-456 (2020).
On the collection of fringe subtrees in random binary trees. (English) Zbl 07600802
Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 546-558 (2020).
Monte Carlo tree search guided by symbolic advice for MDPs. (English) Zbl 07559496
Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 40, 24 p. (2020).
MSC:
68Q85
A novel genetic algorithm for solving the clustered shortest-path tree problem. (English) Zbl 1499.90278
Farkas-based tree interpolation. (English) Zbl 1474.68321
Pichardie, David (ed.) et al., Static analysis. 27th international symposium, SAS 2020, virtual event, November 18–20, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12389, 357-379 (2020).
A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees. (English) Zbl 1477.90041
Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 455-464 (2020).
MSC:
90C10
A synthesis method for path generation of a planar five-bar mechanism based on dynamic self-adaptive atlas database. (English) Zbl 1483.70010
A rapid learning automata-based approach for generalized minimum spanning tree problem. (English) Zbl 1466.90094
MSC:
90C27
The asymptotics of the clustering transition for random constraint satisfaction problems. (English) Zbl 1505.68030
The scalability analysis of a parallel tree search algorithm. (English) Zbl 1462.90098
Reviewer: Savin Treanta (Bucureşti)
Optimistic Monte Carlo tree search with sampled information relaxation dual bounds. (English) Zbl 1457.90168
A multi-level tree search algorithm for three dimensional container loading problem. (Chinese. English summary) Zbl 1474.90537
On the independence number of some random trees. (English) Zbl 1468.60015
Reviewer: Yilun Shang (Newcastle)
Verifying the gaming strategy of self-learning game by using PRISM-games. (English) Zbl 1458.68189
Vasant, Pandian (ed.) et al., Intelligent computing and optimization. Proceedings of the 2nd international conference on intelligent computing and optimization 2019 (ICO 2019), Koh Samui, Thailand, October 3–4, 2019. Cham: Springer. Adv. Intell. Syst. Comput. 1072, 148-159 (2020).
Parameterized algorithms for module map problems. (English) Zbl 1442.05226
MSC:
05C85
Filter Results by …
Document Type
- Journal Articles (804)
- Collection Articles (188)
- Books (29)
all
top 5
Author
- Devroye, Luc P. J. A. (15)
- Drmota, Michael (10)
- Christofides, Nicos (9)
- Wood, Derick (9)
- Beasley, John E. (8)
- Prodinger, Helmut (8)
- Tarjan, Robert Endre (8)
- Neininger, Ralph (7)
- Pittel, Boris G. (7)
- Toth, Paolo (7)
- Bortfeldt, Andreas (6)
- Guan, Xiucui (6)
- Mehlhorn, Kurt (6)
- Ottmann, Thomas A. (6)
- Alpern, Steve (5)
- Althöfer, Ingo (5)
- Grübel, Rudolf (5)
- Janson, Svante (5)
- Mingozzi, Aristide (5)
- Moshkov, Mikhail Ju. (5)
- Pearl, Judea (5)
- Szpankowski, Wojciech (5)
- Blum, Christian (4)
- Chauvin, Brigitte (4)
- Dechter, Rina (4)
- Fernau, Henning (4)
- Flajolet, Philippe (4)
- Fuchs, Michael (4)
- Glover, Fred W. (4)
- Haralick, Robert M. (4)
- Hecher, Markus (4)
- Horibe, Yasuichi (4)
- Hwang, Hsien-Kuei (4)
- Katagiri, Hideki (4)
- Laporte, Gilbert (4)
- Larmore, Lawrence L. (4)
- Lim, Andrew (4)
- Mitra, Gautam (4)
- Mladenović, Nenad (4)
- Nau, Dana S. (4)
- Niedermeier, Rolf (4)
- Pedroso, João Pedro (4)
- Scheffler, Robert (4)
- Suzuki, Toshio (4)
- Woltran, Stefan (4)
- Wong, Chak-Kuen (4)
- Zhang, Binwu (4)
- Alber, Jochen (3)
- Asano, Takao (3)
- Bóna, Miklós (3)
- Cain, Alan J. (3)
- Cheng, Siu-Wing (3)
- Golden, Bruce L. (3)
- Hao, Jin-Kao (3)
- Jacobs, Tobias (3)
- Jia, Junhua (3)
- Kirschenhofer, Peter (3)
- Kolpakov, Roman M. (3)
- Lorenz, Ulf (3)
- Mahmoud, Hosam M. (3)
- Malheiro, António (3)
- Martello, Silvano (3)
- Miller, Dale Allen (3)
- Müller, Martin (3)
- Munro, J. Ian (3)
- Näher, Stefan (3)
- Ozdamar, Linet (3)
- Pardalos, Panos M. (3)
- Posypkin, Mikhail A. (3)
- Raghavan, S. Raghu (3)
- Rytter, Wojciech (3)
- Schaffer, Jonathan (3)
- Shapiro, Linda G. (3)
- Tsakalidis, Athanasios K. (3)
- Van Wyk, Christopher J. (3)
- Wichert, Andreas (3)
- Zhang, Qiao (3)
- Achterberg, Tobias (2)
- Aggarwal, Charu C. (2)
- Ahlswede, Rudolf (2)
- Akl, Selim G. (2)
- Atallah, Mikhail J. (2)
- Avis, David M. (2)
- Azad, Mohammad (2)
- Bagchi, Amitava (2)
- Baswana, Surender (2)
- Bein, Doina (2)
- Beisegel, Jesse (2)
- Benkner, Louisa Seelbach (2)
- Berthold, Timo (2)
- Bhattacharya, Subir (2)
- Biggins, J. D. (2)
- Bliem, Bernhard (2)
- Bodlaender, Hans L. (2)
- Boizumault, Patrice (2)
- Booth, Heather D. (2)
- Bratko, Ivan (2)
- Busatto-Gaston, Damien (2)
- Chakrabarti, Partha Pratim (2)
- Chakraborty, Debraj (2)
- and 1,714 more Authors
all
top 5
Serial
- Eur. J. Oper. Res. (48)
- Inf. Process. Lett. (39)
- SIAM J. Comput. (35)
- Theor. Comput. Sci. (33)
- Artif. Intell. (25)
- Discrete Appl. Math. (22)
- Comput. Oper. Res. (20)
- Algorithmica (19)
- Random Struct. Algorithms (13)
- Inf. Sci. (12)
- J. Algorithms (11)
- Int. J. Found. Comput. Sci. (11)
- Int. J. Comput. Math. (9)
- J. Assoc. Comput. Mach. (7)
- Networks (7)
- J. Glob. Optim. (7)
- Acta Inf. (6)
- Oper. Res. (6)
- Combinatorica (6)
- Ann. Oper. Res. (6)
- Mach. Learn. (6)
- Pattern Recognition (6)
- Int. Trans. Oper. Res. (6)
- J. Heuristics (6)
- INFORMS J. Comput. (6)
- Discrete Math. Theor. Comput. Sci. (6)
- J. Mach. Learn. Res. (6)
- Optim. Lett. (6)
- Appl. Math. Comput. (5)
- Computing (5)
- J. Comb. Theory, Ser. A (5)
- IEEE Trans. Pattern Anal. Mach. Intell. (5)
- Fundam. Inform. (5)
- ACM J. Exp. Algorithm. (5)
- Discrete Math. (4)
- ACM Trans. Database Syst. (4)
- BIT (4)
- J. Comput. Syst. Sci. (4)
- Manage. Sci. (4)
- Inf. Comput. (4)
- SIAM J. Discrete Math. (4)
- Cybern. Syst. Anal. (4)
- Ann. Math. Artif. Intell. (4)
- Constraints (4)
- Adv. Appl. Probab. (3)
- IEEE Trans. Inf. Theory (3)
- Comput. J. (3)
- Fuzzy Sets Syst. (3)
- Int. J. Comput. Inform. Sci. (3)
- J. Oper. Res. Soc. Japan (3)
- Nav. Res. Logist. (3)
- Theory Decis. (3)
- J. Parallel Distrib. Comput. (3)
- Ann. Appl. Probab. (3)
- Games Econ. Behav. (3)
- RAIRO, Inform. Théor. Appl. (3)
- Comput. Optim. Appl. (3)
- Comb. Probab. Comput. (3)
- Congr. Numerantium (3)
- Theory Comput. Syst. (3)
- ESAIM, Probab. Stat. (3)
- J. Comb. Optim. (3)
- J. ACM (3)
- Wuhan Univ. J. Nat. Sci. (3)
- J. Softw. (3)
- Comput. Netw. (3)
- Control Decis. (3)
- J. Discrete Algorithms (3)
- Comput. Math. Appl. (2)
- IEEE Trans. Reliab. (2)
- ACM Trans. Math. Softw. (2)
- Ann. Probab. (2)
- IEEE Trans. Autom. Control (2)
- J. Algebra (2)
- J. Comb. Inf. Syst. Sci. (2)
- J. Comput. Appl. Math. (2)
- J. Oper. Res. Soc. (2)
- Math. Program. Study (2)
- Math. Program. (2)
- Opsearch (2)
- RAIRO, Rech. Opér. (2)
- Cybern. Syst. (2)
- Stat. Probab. Lett. (2)
- Comput. Artif. Intell. (2)
- Stat. Decis. (2)
- Parallel Comput. (2)
- J. Log. Program. (2)
- J. Comput. Sci. Technol. (2)
- J. Inf. Process. Cybern. (2)
- J. Autom. Reasoning (2)
- Int. J. Approx. Reasoning (2)
- Asia-Pac. J. Oper. Res. (2)
- AI Commun. (2)
- Signal Process. (2)
- Comput. Geom. (2)
- ORSA J. Comput. (2)
- Autom. Remote Control (2)
- Commun. ACM (2)
- IEEE Trans. Syst. Man Cybern. (2)
- Comput. Stat. Data Anal. (2)
- and 191 more Serials
all
top 5
Year of Publication
- 2024 (6)
- 2023 (17)
- 2022 (26)
- 2021 (26)
- 2020 (29)
- 2019 (26)
- 2018 (22)
- 2017 (30)
- 2016 (31)
- 2015 (31)
- 2014 (28)
- 2013 (25)
- 2012 (29)
- 2011 (24)
- 2010 (47)
- 2009 (26)
- 2008 (33)
- 2007 (29)
- 2006 (15)
- 2005 (19)
- 2004 (19)
- 2003 (25)
- 2002 (23)
- 2001 (19)
- 2000 (18)
- 1999 (14)
- 1998 (15)
- 1997 (23)
- 1996 (20)
- 1995 (14)
- 1994 (19)
- 1993 (26)
- 1992 (13)
- 1991 (16)
- 1990 (20)
- 1989 (21)
- 1988 (26)
- 1987 (19)
- 1986 (18)
- 1985 (20)
- 1984 (16)
- 1983 (20)
- 1982 (20)
- 1981 (13)
- 1980 (16)
- 1979 (19)
- 1978 (6)
- 1976 (1)
- 1975 (1)
- 1974 (1)
- 1971 (1)
all
top 3
Main Field
- 68-XX (689)
- 90-XX (305)
- 05-XX (185)
- 91-XX (77)
- 65-XX (64)
- 60-XX (61)
- 62-XX (45)
- 94-XX (28)
- 92-XX (17)
- 03-XX (15)
- 52-XX (10)
- 93-XX (9)
- 06-XX (7)
- 11-XX (6)
- 76-XX (5)
- 81-XX (4)
- 82-XX (4)
- 20-XX (3)
- 15-XX (2)
- 28-XX (2)
- 37-XX (2)
- 51-XX (2)
- 70-XX (2)
- 74-XX (2)
- 00-XX (1)
- 33-XX (1)
- 41-XX (1)
- 42-XX (1)
- 43-XX (1)
- 49-XX (1)
- 54-XX (1)
- 86-XX (1)
- 97-XX (1)
all
top 3
Software
- Tabu search (18)
- TSPLIB (13)
- C4.5 (10)
- OR-Library (10)
- UCI-ml (9)
- CPLEX (8)
- Decision tree for optimization software (8)
- Algorithm 447 (7)
- Z-Tree (7)
- Algorithm 97 (6)
- FEASPUMP (5)
- MIPLIB (5)
- MIPLIB2003 (5)
- VRP (5)
- Adam (4)
- AlphaZero (4)
- BRP (4)
- Benchmarks for Optimization Software (4)
- DIMACS (4)
- FLANN (4)
- GitHub (4)
- LEDA (4)
- Scatter Search (4)
- ABACUS (3)
- Concorde (3)
- Gecode (3)
- Isabelle/HOL (3)
- K_TREE/K_SUBGRAPH (3)
- MENU-OKF (3)
- MLPACK (3)
- MNIST (3)
- MOD-DIST (3)
- Octane (3)
- Quicksort (3)
- SCIP (3)
- ANN (2)
- Algorithm 457 (2)
- Boost (2)
- CFSQP (2)
- CMA-ES (2)
- COIN-OR (2)
- COMET (2)
- Chaff (2)
- Choco (2)
- DINS (2)
- DISSECT (2)
- EISPACK (2)
- GIB (2)
- GRASP (2)
- GSLIB (2)
- GloVe (2)
- Gurobi (2)
- HC-ACO (2)
- HOL (2)
- Hyperopt (2)
- Isabelle (2)
- Keras (2)
- Knapsack (2)
- M-TREE (2)
- MCTS-Solver (2)
- MOEA/D (2)
- MiniSat (2)
- MoHex (2)
- NSGA-II (2)
- ORSEE (2)
- PROFIL/BIAS (2)
- Pegasos (2)
- SITATION (2)
- SPEA2 (2)
- Scikit (2)
- SoPlex (2)
- Theano (2)
- XPRESS (2)
- XSB (2)
- YAP-Prolog (2)
- clasp (2)
- gmp (2)
- ilsts-wvcp (2)
- tw-heuristic (2)
- word2vec (2)
- ALIAS (1)
- ALPS (1)
- ASKIT (1)
- ASlib (1)
- AWK (1)
- Abella (1)
- AdaptiveStressTesting.jl (1)
- Algorithm 37 (1)
- Algorithm 489 (1)
- Algorithm 632 (1)
- Algorithm 864 (1)
- Amortized Complexity (1)
- Apollo (1)
- Approxrl (1)
- Archive Formal Proofs (1)
- Azucar (1)
- B-Prolog (1)
- BIONJ (1)
- BL data set (1)
- BLIS (1)
- and 292 more Software Packages
