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
Venue 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 704 matches
- 2024
- Yuji Koguma:
Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems. IEEE Access 12: 19059-19076 (2024) - Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, Dave Pfliegler, Daria Stepanova:
Adaptive large-neighbourhood search for optimisation in answer-set programming. Artif. Intell. 337: 104230 (2024) - Ahmad Abouyee Mehrizi, Reza Ghanbari, Sedigheh Sadeghi, Khatere Ghorbani-Moghadam:
Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms. Appl. Soft Comput. 165: 112109 (2024) - Einosuke Iida, Makoto Yamashita:
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems. Comput. Optim. Appl. 88(2): 643-676 (2024) - Jingyi Zhao, Mark Poon, Vincent Y. F. Tan, Zhenzhen Zhang:
A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem. Eur. J. Oper. Res. 317(3): 921-935 (2024) - Baoyu Liao, Shaojun Lu, Tao Jiang, Xing Zhu:
A variable neighborhood search and mixed-integer programming models for a distributed maintenance service network scheduling problem. Int. J. Prod. Res. 62(20): 7466-7485 (2024) - Tengfei Wu, Zeqiang Zhang, Yanqing Zeng, Yu Zhang:
Mixed-integer programming model and hybrid local search genetic algorithm for human-robot collaborative disassembly line balancing problem. Int. J. Prod. Res. 62(5): 1758-1782 (2024) - Alvaro Sierra-Altamiranda, Hadi Charkhgard, Iman Dayarian, Ali Eshragh, Sorna Javadi:
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming. Optim. Lett. 18(9): 2051-2078 (2024) - Xuan Wu, Di Wang, Huanhuan Chen, Lele Yan, Yubin Xiao, Chunyan Miao, Hongwei Ge, Dong Xu, Yanchun Liang, Kangping Wang, Chunguo Wu, You Zhou:
Neural Architecture Search for Text Classification With Limited Computing Resources Using Efficient Cartesian Genetic Programming. IEEE Trans. Evol. Comput. 28(3): 638-652 (2024) - Yi Zhang, Sheng Zhang, Yicheng Zhang, Yifang Yin:
A Study of TMA Aircraft Conflict-Free Routing and Operation: With Mixed Integer Linear Programming, Multi-Agent Path Finding, and Metaheuristic-Based Neighborhood Search. IEEE Trans. Intell. Transp. Syst. 25(10): 13976-13990 (2024) - Ryo Kuroiwa, J. Christopher Beck:
Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming. AAAI 2024: 20743-20750 - Ryan Yen, Nicole Sultanum, Jian Zhao:
To Search or To Gen? Exploring the Synergy between Generative AI and Web Search in Programming. CHI Extended Abstracts 2024: 327:1-327:8 - Zehan Li, Jianfei Zhang, Chuantao Yin, Yuanxin Ouyang, Wenge Rong:
ProCQA: A Large-scale Community-based Programming Question Answering Dataset for Code Search. LREC/COLING 2024: 13057-13067 - Peng Lin, Mengchuan Zou, Shaowei Cai:
An Efficient Local Search Solver for Mixed Integer Programming. CP 2024: 19:1-19:19 - Thibaut Septon, Santiago Villarreal-Narvaez, Xavier Devroey, Bruno Dumas:
Exploiting Semantic Search and Object-Oriented Programming to Ease Multimodal Interface Development. EICS (Companion) 2024: 74-80 - Camilo De La Torre, Sylvain Cussat-Blanc, Dennis Wilson, Yuri Lavinas:
On Search Trajectory Networks for Graph Genetic Programming. GECCO Companion 2024: 1681-1685 - Peng Lin, Mengchuan Zou, Zhihan Chen, Shaowei Cai:
ParaILP: A Parallel Local Search Framework for Integer Linear Programming with Cooperative Evolution Mechanism. IJCAI 2024: 6949-6957 - Harald Räcke, Stefan Schmid, Radu Vintan:
Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search. INFOCOM 2024: 1930-1939 - Xiaowei Ye, Rong-Hua Li, Lei Liang, Zhizhen Liu, Longlong Lin, Guoren Wang:
Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach. KDD 2024: 3907-3918 - Duc-Tuan Luu, Khanh-Linh Bui-Le, Duy-Ngoc Nguyen, Vinh-Tiep Nguyen, Minh-Triet Tran:
VISA: Video Interactive Search with Advanced Visual Programming. MAPR 2024: 1-6 - Saining Liu, João Guilherme Cavalcanti Costa, Yi Mei, Mengjie Zhang:
GPGLS: Genetic Programming Guided Local Search for Large-Scale Vehicle Routing Problems. PPSN (1) 2024: 36-51 - James Skripchuk, John Bacher, Yang Shi, Keith Tran, Thomas W. Price:
Novices' Perceptions of Web-Search and AI for Programming. SIGCSE (2) 2024: 1818-1819 - Ryan Yen, Nicole Sultanum, Jian Zhao:
To Search or To Gen? Exploring the Synergy between Generative AI and Web Search in Programming. CoRR abs/2402.00764 (2024) - Christian Raymond, Qi Chen, Bing Xue, Mengjie Zhang:
Fast and Efficient Local Search for Genetic Programming Based Loss Function Learning. CoRR abs/2403.00865 (2024) - Zehan Li, Jianfei Zhang, Chuantao Yin, Yuanxin Ouyang, Wenge Rong:
ProCQA: A Large-scale Community-based Programming Question Answering Dataset for Code Search. CoRR abs/2403.16702 (2024) - Einosuke Iida, Makoto Yamashita:
An inexact infeasible arc-search interior-point method for linear programming problems. CoRR abs/2403.18155 (2024) - Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara:
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. CoRR abs/2405.11305 (2024) - Quanjun Zhang, Chunrong Fang, Ye Shang, Tongke Zhang, Shengcheng Yu, Zhenyu Chen:
No Man is an Island: Towards Fully Automatic Programming by Code Search, Code Generation and Program Repair. CoRR abs/2409.03267 (2024) - Haibo Wang, Bahram Alidaee:
Fast Local Search Strategies for Large-Scale General Quadratic Integer Programming. CoRR abs/2409.14176 (2024) - Pengfei Wang, Jiantao Song, Shiqing Xin, Shuang-Min Chen, Changhe Tu, Wenping Wang, Jiaye Wang:
Efficient Nearest Neighbor Search Using Dynamic Programming. CoRR abs/2409.15023 (2024)
skipping 674 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-11-29 02:52 CET 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