Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,551 matches
- 2024
- Marco Cococcioni, Alessandro Cudazzo, Lorenzo Fiaschi, Massimo Pappalardo, Yaroslav D. Sergeyev:
A new cutting plane method for lexicographic multi-objective integer linear programming. Commun. Nonlinear Sci. Numer. Simul. 129: 107674 (2024) - Hossein Gitinavard, Vahid Mohagheghi, Seyed Meysam Mousavi, Ahmad Makui:
A new bi-stage interactive possibilistic programming model for perishable logistics distribution systems under uncertainty. Expert Syst. Appl. 238(Part E): 122121 (2024) - Zemin Zong, Xuewen Mu:
A new formulation for second-order cone programming support vector machine. Int. J. Mach. Learn. Cybern. 15(3): 1101-1111 (2024) - Paul Denny, Juho Leinonen, James Prather, Andrew Luxton-Reilly, Thezyrie Amarouche, Brett A. Becker, Brent N. Reeves:
Prompt Problems: A New Programming Exercise for the Generative AI Era. SIGCSE (1) 2024: 296-302 - Sebastian Berndt, Matthias Mnich, Tobias Stamm:
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM 2024: 82-95 - Simiao Zhang, Jiaping Wang, Guoliang Dong, Jun Sun, Yueling Zhang, Geguang Pu:
Experimenting a New Programming Practice with LLMs. CoRR abs/2401.01062 (2024) - James Prather, Paul Denny, Juho Leinonen, David H. Smith IV, Brent N. Reeves, Stephen MacNeil, Brett A. Becker, Andrew Luxton-Reilly, Thezyrie Amarouche, Bailey Kimmel:
Interactions with Prompt Problems: A New Way to Teach Programming with Large Language Models. CoRR abs/2401.10759 (2024) - Gustavo Bramao, Ilia Tarygin:
The New Era of Dynamic Pricing: Synergizing Supervised Learning and Quadratic Programming. CoRR abs/2402.14844 (2024) - 2023
- Zilin Chen:
Towards A Practical High-Assurance Systems Programming Language. University of New South Wales, Sydney, Australia, 2023 - Kenny Dow:
Memory Safety Acceleration on RISC-V for C Programming Language. University of New South Wales, Sydney, Australia, 2023 - Joshua Schmidt:
New Applications and Techniques for Constraint Programming in B. University of Düsseldorf, Germany, 2023 - Duc Nguyen, Minh-Thai Tran, Bac Le:
A new algorithm using integer programming relaxation for privacy-preserving in utility mining. Appl. Intell. 53(21): 25106-25118 (2023) - Sitoshna Jatty, Niharika Singh, Ignacio E. Grossmann, Leonardo Salsano de Assis, Christos Galanopoulos, Pablo García-Herreros, Bianca Springub, Nga Tran:
Diagnosis of linear programming supply chain optimization models: Detecting infeasibilities and minimizing changes for new parameter values. Comput. Chem. Eng. 171: 108139 (2023) - Marianna E.-Nagy, Anita Varga:
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation. Central Eur. J. Oper. Res. 31(3): 691-711 (2023) - Helena Gaspars-Wieloch:
Possible new applications of the interactive programming based on aspiration levels - case of pure and mixed strategies. Central Eur. J. Oper. Res. 31(3): 733-749 (2023) - Seyda Gür, Mehmet Pinarbasi, Haci Mehmet Alakas, Tamer Eren:
Operating room scheduling with surgical team: a new approach with constraint programming and goal programming. Central Eur. J. Oper. Res. 31(4): 1061-1085 (2023) - Tunjo Peric, Josip Matejas, Zoran Babic:
Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem. Central Eur. J. Oper. Res. 31(3): 751-767 (2023) - David Ek, Anders Forsgren:
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming. Comput. Optim. Appl. 86(1): 1-48 (2023) - Rick S. H. Willemsen, Wilco van den Heuvel, Michel van de Velden:
A new mixed integer programming approach for inverse correspondence analysis. Comput. Oper. Res. 160: 106375 (2023) - Tiina S. Korhonen, Laura Salo, Noora L. Laakso, Aino Seitamaa, Kati Sormunen, Minna Kukkonen, Heidi Forsström:
Finnish teachers as adopters of educational innovation: perceptions of programming as a new part of the curriculum. Comput. Sci. Educ. 33(1): 94-116 (2023) - Mariana Mesquita-Cunha, José Rui Figueira, Ana Paula F. D. Barbosa-Póvoa:
New ϵ-constraint methods for multi-objective integer linear programming: A Pareto front representation approach. Eur. J. Oper. Res. 306(1): 286-307 (2023) - Kangshun Li, Leqing Lin, Jiaming Li, Siwei Chen, Hassan Jalil:
A New Algorithm for Detection of Animal and Plant Ion Concentration Based on Gene Expression Programming. Int. J. Cogn. Informatics Nat. Intell. 17(1): 1-11 (2023) - Levi Ribeiro de Abreu, Marcelo Seido Nagano, Bruno A. Prata:
A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. Int. J. Prod. Res. 61(24): 8560-8579 (2023) - Shyi-Ming Chen, Pei-Hsun Kao:
Multiattribute decision making based on nonlinear programming methodology, the Euclidean distance between IVIFVs, and new score function of IVIFVs. Inf. Sci. 646: 119403 (2023) - Meiling Jin, Fengming Liu, Shize Ning, Chang Liu, Chunhua Gao:
A new uncertain multi-objective programming model with chance-entropy constraint for advertising promotion. J. Ambient Intell. Humaniz. Comput. 14(7): 9651-9665 (2023) - Jing Zhou, Dongmei Zhang, Lin Wang, Zhijun Xu:
A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues. J. Comput. Appl. Math. 423: 114944 (2023) - Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà, Vu Hoang Vuong Nguyen:
New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule. J. Comb. Optim. 46(1): 1 (2023) - Yingzhe Xu, Cheng Lu, Zhibin Deng, Ya-Feng Liu:
New semidefinite relaxations for a class of complex quadratic programming problems. J. Glob. Optim. 87(1): 255-275 (2023) - Moslem Zamani:
New bounds for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 85(3): 595-613 (2023) - Sandra Catalán, Francisco D. Igual, José R. Herrero, Rafael Rodríguez-Sánchez, Enrique S. Quintana-Ortí:
Programming parallel dense matrix factorizations and inversion for new-generation NUMA architectures. J. Parallel Distributed Comput. 175: 51-65 (2023)
skipping 1,521 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-23 08:08 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint