Остановите войну!
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 539 matches
- 2024
- Nada A. M. Alshomrani, Abdelhalim Ebaid, Faten Aldosari, Mona D. Aljoufi:
On the Exact Solution of a Scalar Differential Equation via a Simple Analytical Approach. Axioms 13(2): 129 (2024) - Cléa Martinez, Marie-Laure Espinouse, Maria di Mascolo:
An exact two-phase approach to re-optimize tours in home care planning. Comput. Oper. Res. 161: 106408 (2024) - Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa:
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. Comput. Oper. Res. 162: 106467 (2024) - Ming-Hung Kao, Ping-Han Huang:
Hybrid exact-approximate design approach for sparse functional data. Comput. Stat. Data Anal. 190: 107850 (2024) - Faiz Hamid, Yogesh Kumar Agarwal:
Train stop scheduling problem: An exact approach using valid inequalities and polar duality. Eur. J. Oper. Res. 313(1): 207-224 (2024) - Imene Zaidi, Ammar Oulamara, Lhassane Idoumghar, Michel Basset:
Minimizing grid capacity in preemptive electric vehicle charging orchestration: Complexity, exact and heuristic approaches. Eur. J. Oper. Res. 312(1): 22-37 (2024) - Pengyu Xu, Huailai Zhou, Xingye Liu, Jie Zhou, Yuyong Yang:
Global Optimizing Prestack Seismic Inversion Approach Using an Accurate Hessian Matrix Based on Exact Zoeppritz Equations. IEEE Trans. Geosci. Remote. Sens. 62: 1-16 (2024) - Katie Clinch, Serge Gaspers, Abdallah Saffidine, Tiankuang Zhang:
A Piecewise Approach for the Analysis of Exact Algorithms. CoRR abs/2402.10015 (2024) - 2023
- Laurent Lemarchand:
Approches exactes et heuristiques pour l'exploration d'architectures logicielles et matérielles: Applications dans les domaines du Temps Réel, du Cloud et du Routage. (Exact and heuristic approaches for Design Space Exploration of software and hardware architectures). University of Western Brittany, Brest, France, 2023 - Prince Mahmud, Anisur Rahman, Kamrul Hasan Talukder:
An Improved Hashing Approach for Biological Sequence to Solve Exact Pattern Matching Problems. Appl. Comput. Intell. Soft Comput. 2023: 3278505:1-3278505:16 (2023) - Igor P. Vieira, Fernando O. Souza, Leonardo A. Mozelli:
Geometric approach to robust stability analysis of Linear Parameter-Varying systems: Computational trade-offs between the exact and the simplex convex hulls. Appl. Math. Comput. 451: 128017 (2023) - Song Pu, Chang Xia:
Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels. Asia Pac. J. Oper. Res. 40(3): 2250026:1-2250026:23 (2023) - Zeinab Elmi, Bokang Li, Benbu Liang, Yui-yip Lau, Marta Borowska-Stefanska, Szymon Wisniewski, Maxim A. Dulebenets:
An epsilon-constraint-based exact multi-objective optimization approach for the ship schedule recovery problem in liner shipping. Comput. Ind. Eng. 183: 109472 (2023) - Tolga Karabas, Sedef Meral:
An exact solution method and a genetic algorithm-based approach for the unit commitment problem in conventional power generation systems. Comput. Ind. Eng. 176: 108876 (2023) - Sebastian Spindler, Claudius Steinhardt, Robert Klein:
Exact solution approaches for order acceptance and scheduling decisions in m-machine open shops. Comput. Ind. Eng. 176: 108952 (2023) - Mohamed Karim Hajji, Hatem Hadda, Najoua Dridi:
Makespan Minimization for the Two-Stage Hybrid Flow Shop Problem with Dedicated Machines: A Comprehensive Study of Exact and Heuristic Approaches. Comput. 11(7): 137 (2023) - Nicolas Cheimanoff, Pierre Féniès, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem. Comput. Oper. Res. 153: 106174 (2023) - Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice:
Exact approaches for the Minimum Subgraph Diameter Problem. Comput. Oper. Res. 150: 106050 (2023) - Matheus Freitas, João Marcos Pereira Silva, Eduardo Uchoa:
A unified exact approach for Clustered and Generalized Vehicle Routing Problems. Comput. Oper. Res. 149: 106040 (2023) - Luciana Melchiori, Graciela L. Nasini, Jorge M. Montagna, Gabriela Corsano:
Resources synchronization in a full truckload pickup and delivery problem: An exact approach. Comput. Oper. Res. 151: 106118 (2023) - Hao Zhang, Shaowen Yao, Qiang Liu, Jiewu Leng, Lijun Wei:
Exact approaches for the unconstrained two-dimensional cutting problem with defects. Comput. Oper. Res. 160: 106407 (2023) - Matthew W. Harris, David K. Geller, Simon Shuster:
A Measure-Driven Approach for Exact Solution of Gauss' Variational Equations Under Impulse Control. IEEE Control. Syst. Lett. 7: 565-570 (2023) - Júlia Cária de Freitas, Puca Huachi Vaz Penna, Túlio A. M. Toffolo:
Exact and heuristic approaches to Truck-Drone Delivery Problems. EURO J. Transp. Logist. 12: 100094 (2023) - Maria Albareda-Sambola, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo:
An exact approach for the reliable fixed-charge location problem with capacity constraints. Eur. J. Oper. Res. 311(1): 24-35 (2023) - Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier:
Exact approaches for the combined cell layout problem. Eur. J. Oper. Res. 305(2): 530-546 (2023) - Romain Fontaine, Jilles Dibangoye, Christine Solnon:
Exact and anytime approach for solving the time dependent traveling salesman problem with time windows. Eur. J. Oper. Res. 311(3): 833-844 (2023) - Mauro Gaggero, Massimo Paolucci, Roberto Ronco:
Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs. Eur. J. Oper. Res. 311(3): 845-866 (2023) - Konstantinos Gkiotsalitis, Christina A. Iliopoulou, Konstantinos L. Kepaptsoglou:
An exact approach for the multi-depot electric bus scheduling problem with time windows. Eur. J. Oper. Res. 306(1): 189-206 (2023) - Dmytro Matsypura, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev:
Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. Eur. J. Oper. Res. 308(3): 1021-1036 (2023) - Mohammad Reihaneh, Sina Ansari, Farbod Farhadi:
Patient appointment scheduling at hemodialysis centers: An exact branch and price approach. Eur. J. Oper. Res. 309(1): 35-52 (2023)
skipping 509 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-25 08:27 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