Остановите войну!
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
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 194 matches
- 2024
- Ting Wang, Hongwei Liu:
A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems. Numer. Algorithms 95(1): 207-241 (2024) - Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Generalized nash fairness solutions for bi-objective minimization problems. Networks 83(1): 83-99 (2024) - 2023
- Wenqi Wang, Zhicheng Liu, Donglei Du, Peihao Shi, Xiaoyan Zhang:
Minimization Problems with Non-Submodular Cover Constraint. Asia Pac. J. Oper. Res. 40(5): 2340012:1-2340012:19 (2023) - Luigi Di Biasi, Fabiola De Marco, Alessia Auriemma Citarella, Modesto Castrillón Santana, Paola Barra, Genoveffa Tortora:
Refactoring and performance analysis of the main CNN architectures: using false negative rate minimization to solve the clinical images melanoma detection problem. BMC Bioinform. 24(1): 386 (2023) - Seifeddine Abdelhak, Issam Nouaouri, Saoussen Krichen, Gilles Goncalves:
Minimization of Makespan and Total Completion Time for Hybrid Job Shop Scheduling Problem Using Genetic Approaches. Int. J. Artif. Intell. Tools 32(8): 2350041:1-2350041:36 (2023) - Szilárd Csaba László:
A Forward-Backward Algorithm With Different Inertial Terms for Structured Non-Convex Minimization Problems. J. Optim. Theory Appl. 198(1): 387-427 (2023) - Eyal Gur, Shoham Sabach, Shimrit Shtern:
Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems. Math. Oper. Res. 48(1): 53-77 (2023) - Qimeng Yu, Simge Küçükyavuz:
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints. Math. Program. 201(1): 803-861 (2023) - Radislav Vaisman, Ilya B. Gertsbakh:
Optimal balanced chain decomposition of partially ordered sets with applications to operating cost minimization in aircraft routing problems. Public Transp. 15(1): 199-225 (2023) - Adisak Hanjing, Nattawut Pholasa, Suthep Suantai:
An Algorithm for Solving Common Points of Convex Minimization Problems with Applications. Symmetry 15(1): 7 (2023) - Enze Sun, Zonghan Yang, Yuhao Zhang:
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. ESA 2023: 97:1-97:14 - Flávia Chorobura, François Glineur, Ion Necoara:
Can random proximal coordinate descent be accelerated on nonseparable convex composite minimization problems? ECC 2023: 1-6 - 2022
- Prabhjot Kaur, Anuj Sharma, Vanita Verma, Kalpana Dahiya:
An alternate approach to solve two-level hierarchical time minimization transportation problem. 4OR 20(1): 23-61 (2022) - S. M. Mirhadi, S. A. MirHassani:
A solution approach for cardinality minimization problem based on fractional programming. J. Comb. Optim. 44(1): 583-602 (2022) - Mikhail Yu. Kokurin:
On the global minimization of discretized residual functionals of conditionally well-posed inverse problems. J. Glob. Optim. 84(1): 149-176 (2022) - Amar Andjouh, Mohand Ouamer Bibi:
Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems. J. Optim. Theory Appl. 192(1): 360-378 (2022) - Pham Quy Muoi, Duong Xuan Hiep:
Proximal algorithm for minimization problems in l0-regularization for nonlinear inverse problems. Numer. Algorithms 91(1): 367-388 (2022) - Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyril Briand:
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations. Oper. Res. Lett. 50(1): 50-56 (2022) - Christian Pfeiffer, Arne Schulz:
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. OR Spectr. 44(1): 87-119 (2022) - Giulia Caselli, Giomaria Columbu, Manuel Iori, Carlo Alberto Magni:
Mixed Integer Linear Programming for CO2 emissions minimization in a Waste Transfer Facility Location Problem. INOC 2022: 1-6 - Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier:
Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. INOC 2022: 1-6 - Mamadou Barry, Coumba Diallo, Babacar Mbaye Ndiaye:
Optimal mass transportation for noise minimization problem around an airport. ISIVC 2022: 1-6 - 2021
- Kimmo Nurmi, Nico Kyngäs:
A Successful Three-Phase Metaheuristic for the Shift Minimization Personal Task Scheduling Problem. Adv. Oper. Res. 2021: 8876990:1-8876990:12 (2021) - Yue Xie, Uday V. Shanbhag:
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems. Comput. Optim. Appl. 78(1): 43-85 (2021) - Alessandro Falsone, Maria Prandini:
A Distributed Dual Proximal Minimization Algorithm for Constraint-Coupled Optimization Problems. IEEE Control. Syst. Lett. 5(1): 259-264 (2021) - Reshma Chirayil Chandrasekharan, Pieter Smet, Tony Wauters:
An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. J. Heuristics 27(1-2): 205-227 (2021) - Jianming Zhu, Peikun Ni, Guoqing Wang, Yuan Li:
Misinformation influence minimization problem based on group disbanded in social networks. Inf. Sci. 572: 1-15 (2021) - Jialiang Xu, Yun-Bin Zhao:
Dual-density-based reweighted ℓ 1-algorithms for a class of ℓ 0-minimization problems. J. Glob. Optim. 81(3): 749-772 (2021) - Dan Garber:
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems. SIAM J. Optim. 31(1): 727-753 (2021) - 2020
- Huan Gao, Yingyi Li, Haibin Zhang:
The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem. Asia Pac. J. Oper. Res. 37(4): 2040002:1-2040002:16 (2020)
skipping 164 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-24 21:50 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