![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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 398 matches
- 2024
- Fabián Riquelme
, Francisco Muñoz, Rodrigo Olivares:
On the max-min influence spread problem: A multi-objective optimization approach. Appl. Soft Comput. 154: 111343 (2024) - Sasan Mahmoudinazlou
, Changhyun Kwon
:
A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem. Comput. Oper. Res. 162: 106455 (2024) - Nadia Brauner, Evgeny Gurevsky, Mikhail Y. Kovalyov:
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty. Discret. Appl. Math. 349: 106-112 (2024) - Ruizhi Li
, Ruiqi Xu, Fangzhou Wang, Shuli Hu, Yiyuan Wang, Minghao Yin, Hui Li:
A local search algorithm with movement gap and adaptive configuration checking for the maximum weighted s-plex problem. Eng. Appl. Artif. Intell. 133: 108079 (2024) - Minghao Chen, Shuai Wang, Jiazhong Zhang:
A genetic algorithm concerning diversity information for solving the robust influence maximization problem on networks. J. Intell. Fuzzy Syst. 46(2): 4745-4759 (2024) - Alexandros E. Tzikas
, Jinkyoo Park
, Mykel J. Kochenderfer
, Ross E. Allen
:
Distributed Online Planning for Min-Max Problems in Networked Markov Games. IEEE Robotics Autom. Lett. 9(7): 6656-6663 (2024) - Lu Liu, Mingyu Xiao, Yi Zhou:
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. AAAI 2024: 20768-20776 - Jesús Quesada, Francisco Javier Gil Gala, Marko Durasevic, María R. Sierra, Ramiro Varela:
Evolutionary Algorithms for Bin Packing Problem with Maximum Lateness and Waste Minimization. IWINAC (2) 2024: 140-149 - Haoyuan Cai, Sulaiman A. Alghunaim, Ali H. Sayed:
Diffusion Stochastic Optimization for Min-Max Problems. CoRR abs/2401.14585 (2024) - Ahmet Alacaoglu, Donghwan Kim, Stephen J. Wright:
Extending the Reach of First-Order Algorithms for Nonconvex Min-Max Problems with Cohypomonotonicity. CoRR abs/2402.05071 (2024) - Yuxuan Wang, Jiongzhi Zheng, Jinyao Xie, Kun He:
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem. CoRR abs/2405.03176 (2024) - Alexandros E. Tzikas, Jinkyoo Park, Mykel J. Kochenderfer, Ross E. Allen:
Distributed Online Planning for Min-Max Problems in Networked Markov Games. CoRR abs/2405.19570 (2024) - 2023
- Nir Halman, Mikhail Y. Kovalyov
, Alain Quilliot:
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. 4OR 21(2): 235-246 (2023) - Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park, Kyung Min Kim
:
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work. 4OR 21(3): 421-437 (2023) - Yupeng Zhou, Mingjie Fan, Xiaofan Liu, Xin Xu
, Yiyuan Wang, Minghao Yin
:
A master-apprentice evolutionary algorithm for maximum weighted set K-covering problem. Appl. Intell. 53(2): 1912-1944 (2023) - Minghao Chen
, Shuai Wang
, Jiazhong Zhang
:
A multi-factorial evolutionary algorithm concerning diversity information for solving the multitasking Robust Influence Maximization Problem on networks. Connect. Sci. 35(1) (2023) - Jorge Orestes Cerdeira
, Maria João Martins
, Marcos Raydan
:
The max-out min-in problem: A tool for data analysis. Comput. Oper. Res. 154: 106218 (2023) - Maocan Song
, Lin Cheng, Mingyang Du, Chao Sun, Jie Ma, Huimin Ge:
Charging station location problem for maximizing the space-time-electricity accessibility: A Lagrangian relaxation-based decomposition scheme. Expert Syst. Appl. 222: 119801 (2023) - Aghiles Azizen, Kahina Louadj, Mohamed Aidène:
An algorithm for solving a min-max problem by adaptive method. Int. J. Math. Oper. Res. 26(1): 96-110 (2023) - Oliverio Cruz-Mejia
, Adam N. Letchford
:
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82(2): 167-176 (2023) - Amir Beck, Raz Sharon:
A branch and bound method solving the max-min linear discriminant analysis problem. Optim. Methods Softw. 38(5): 1031-1057 (2023) - Manoel B. Campêlo, Jhonata A. S. Matias
:
A strongly polynomial algorithm for the minimum maximum flow degree problem. Oper. Res. Lett. 51(1): 67-71 (2023) - Tinghan Ye
, David B. Shmoys
:
A min-max theorem for the minimum fleet-size problem. Oper. Res. Lett. 51(3): 312-314 (2023) - Axel Böhm:
Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions. Trans. Mach. Learn. Res. 2023 (2023) - Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin:
A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA 2023: 359-368 - Jianxin Tang, Li Zhang
, Pengli Lu, Jimao Lan:
Probing the influence maximization-cost minimization problem in social networks by using a multi-objective discrete differential evolution optimization. CNIOT 2023: 600-606 - Minghao Chen
, Shuai Wang
, Shun Cai
:
Solving the Multitasking Robust Influence Maximization Problem on Networks using a Multi-factorial Evolutionary Algorithm. GECCO Companion 2023: 463-466 - Siyue Zhang, Yiyong Xiao, Xinhao Cui, Ruiyi Yang:
A Linear Programming Approach for Maximum Integral Multiflow and Minimum Multicut Problems in Unrestricted Network. ICAC 2023: 1-4 - Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. IJCAI 2023: 5558-5566 - Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov:
Min-max coverage problems on tree-like metrics. LAGOS 2023: 148-156
skipping 368 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-11 20: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