Остановите войну!
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 138 matches
- 2024
- Nguyen Trong Tri Duc, Jirachai Buddhakulsomsiri, Pham Duc Tai:
A mathematical model for the integrated problem of production network design and inventory positioning. Comput. Ind. Eng. 191: 110170 (2024) - Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen:
The complexity of the timetable-based railway network design problem. Networks 83(2): 289-299 (2024) - Jose M. Tapia-Avitia, Jorge M. Cruz-Duarte, Iván Amaya, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Nelishia Pillay:
Analysing hyper-heuristics based on Neural Networks for the automatic design of population-based metaheuristics in continuous optimisation problems. Swarm Evol. Comput. 89: 101616 (2024) - 2023
- Mehdi Zaferanieh, Maryam Abareshi, Morteza Jafarzadeh:
A bi-level p-facility network design problem in the presence of congestion. Comput. Ind. Eng. 176: 109010 (2023) - Cristiano Maciel da Silva, João Fernando Machry Sarubbi, Somayeh Mokhtari, Leonardo Alvarenga L. Santos, Lucas Diniz Silva, Fernanda Sumika Hojo de Souza, Daniel Ludovico Guidoni, José Marcos Silva Nogueira:
RAGE: A novel strategy for solving non-polynomial problems through the random generation of solutions and incremental reduction of the number of candidates: A case study applied to the design of the network infrastructure for connected vehicles. Expert Syst. Appl. 213(Part): 118900 (2023) - Iwona Chomiak-Orsa, Andrzej Grenczuk, Kamila Luczak:
The Use of the Semantic Network for Categorization of Problems Solved by Design Thinking. ICCIDS 2023: 141-152 - Yu-Ting Su, Qi-Zao Ho, Tzu-Yu Chao, Tzuu-Hseng S. Li:
Design of the self-optimal tuning fuzzy inference system for transformer network-based traveling salesman problem in tidying up objects. iFUZZY 2023: 1-6 - Natalya Weber, Werner Koch, Ozan Erdem, Tom Froese:
On the Use of Associative Memory in Hopfield Networks Designed to Solve Propositional Satisfiability Problems. SSCI 2023: 1352-1358 - Natalya Weber, Werner Koch, Ozan Erdem, Tom Froese:
On the use of associative memory in Hopfield networks designed to solve propositional satisfiability problems. CoRR abs/2307.16807 (2023) - Nadine Friesen, Tim Sander, Karl Nachtigall, Nils Nießen:
The complexity of the Timetable-Based Railway Network Design Problem. CoRR abs/2308.00420 (2023) - 2022
- Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. INFORMS J. Comput. 34(5): 2571-2582 (2022) - Trayan Stamov:
Discrete Bidirectional Associative Memory Neural Networks of the Cohen-Grossberg Type for Engineering Design Symmetry Related Problems: Practical Stability of Sets Analysis. Symmetry 14(2): 216 (2022) - Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. SOSA 2022: 37-56 - Vasco D. Silva, Anna Carolina Finamore, Rui Henriques:
On the Role of Multi-Objective Optimization to the Transit Network Design Problem. CoRR abs/2201.11616 (2022) - 2021
- Jiun-Yu Wu, Mei-Wen Nian:
The dynamics of an online learning community in a hybrid statistics classroom over time: Implications for the question-oriented problem-solving course design with the social network analysis approach. Comput. Educ. 166: 104120 (2021) - Faisal Haider, Decheng Zhang, Marc St-Hilaire, Christian Makaya:
On the Planning and Design Problem of Fog Computing Networks. IEEE Trans. Cloud Comput. 9(2): 724-736 (2021) - Brigitte Jaumard, Yan Wang:
A Two Sub-problem Decomposition for the Optimal Design of Filterless Optical Networks. CoRR abs/2101.01022 (2021) - Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. CoRR abs/2111.02295 (2021) - 2020
- Rui Sa Shibasaki:
Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem. (Méthodes de Décomposition Lagrangienne pour le Problème à Grande Échelle de Synthèse de Réseaux Multi-Flot Avec Coûts Fixes et Capacités). Federal University of Minas Gerais, Belo Horizonte, Brazil, 2020 - Nahid Jafari, John Hearne:
Corrigendum to 'A new method to solve the fully connected Reserve Network Design Problem' [European Journal of Operational Research, 231(1), 2013, 202-209]. Eur. J. Oper. Res. 283(2): 795 (2020) - Hêris Golpîra:
Optimal integration of the facility location problem into the multi-project multi-supplier multi-resource Construction Supply Chain network design under the vendor managed inventory strategy. Expert Syst. Appl. 139 (2020) - Zhen Di, Lixing Yang, Li Wang, Jianguo Qi:
A Robust Network Design Problem Based on the Spatiotemporal Attributes of Activities. IEEE Trans. Intell. Transp. Syst. 21(10): 4294-4307 (2020) - 2019
- Liu Su:
Routing and Designing Networks for Two Transportation Problems. University of South Florida, Tampa, USA, 2019 - Ikram Bouras:
Fixed charge network design problem with user-optimal flows. (Conception de réseaux avec flots optimaux pour les usagers). University of Montpellier, France, 2019 - Thomas Ridremont:
Design of robust networks: application to the design of wind farm cabling networks. (Conception de réseaux robustes: application à des problèmes de câblage dans les parcs éoliens). Conservatoire national des arts et métiers, Paris, France, 2019 - Gilad Kutiel:
Approximation Algorithms for Submodular Maximization and Network Design Problems. Technion - Israel Institute of Technology, Israel, 2019 - Jyoti Dhingra Darbari, Devika Kannan, Vernika Agarwal, P. C. Jha:
Fuzzy criteria programming approach for optimising the TBL performance of closed loop supply chain network design problem. Ann. Oper. Res. 273(1-2): 693-738 (2019) - Alireza Ghafarimoghadam, Sima Ghayebloo, Mir Saman Pishvaee:
A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics. Comput. Appl. Math. 38(4) (2019) - Glaubos Clímaco, Isabel Rosseti, Luidi Simonetti, Marcos A. Guerine:
Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem. Int. Trans. Oper. Res. 26(2): 615-641 (2019) - Vinicius Morais, Geraldo Robson Mateus:
Configuration-based approach for topological problems in the design of wireless sensor networks. Int. Trans. Oper. Res. 26(3): 836-855 (2019)
skipping 108 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-09-07 15: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