![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/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 45 matches
- 2024
- Zhihua Allen-Zhao
, Fengmin Xu, Yu-Hong Dai, Sanyang Liu:
Robust enhanced indexation optimization with sparse industry layout constraint. Comput. Oper. Res. 161: 106420 (2024) - Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A matheuristic for tri-objective binary integer linear programming. Comput. Oper. Res. 161: 106397 (2024) - Hosein Arman
, Abdollah Hadi-Vencheh, Amir-Mohammad Golmohammadi
, Sanaz Dehghani, Mohammad H. Nadimi-Shahraki:
Optimal locating by integrating volumetric fuzzy sets and geographic coordinate system: An application to healthcare. Comput. Oper. Res. 161: 106377 (2024) - Vitor Pimenta dos Reis Arruda
, Luiz Gustavo Bizarro Mirisola
, Nei Yoshihiro Soma:
Rectangle packing with a recursive Pilot Method. Comput. Oper. Res. 161: 106447 (2024) - Hannah Bakker
, Stefan Nickel
:
The Value of the Multi-period Solution revisited: When to model time in capacitated location problems. Comput. Oper. Res. 161: 106428 (2024) - Hatice Çalik
, Tony Wauters, Greet Vanden Berghe
:
The exam location problem: Mathematical formulations and variants. Comput. Oper. Res. 161: 106438 (2024) - José-Fernando Camacho-Vallejo
, Carlos Corpus, Juan G. Villegas:
Metaheuristics for bilevel optimization: A comprehensive review. Comput. Oper. Res. 161: 106410 (2024) - André Luiz Netto Casotti, Renato A. Krohling:
A multi-objective formulation for the team formation problem using Krippendorff's disagreement and sociometric cohesion with Pareto-solutions obtained via evolutionary algorithms. Comput. Oper. Res. 161: 106444 (2024) - Kuo-Hao Chang
, Yi-Chieh Chiang, Tzu-Yin Chang:
Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics. Comput. Oper. Res. 161: 106404 (2024) - Barry R. Cobb:
Intermittent sampling for statistical process control with the number of defectives. Comput. Oper. Res. 161: 106423 (2024) - Federico D'Onofrio
, Giorgio Grani, Marta Monaci
, Laura Palagi:
Margin optimal classification trees. Comput. Oper. Res. 161: 106441 (2024) - Wenqiang Dai, Min Liu, Chengbin Chu, Ming Liu:
Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning. Comput. Oper. Res. 161: 106421 (2024) - Claudia Diamantini
, Ornella Pisacane, Domenico Potena, Emanuele Storti
:
Combining an LNS-based approach and organizational mining for the Resource Replacement Problem. Comput. Oper. Res. 161: 106446 (2024) - Bencomo Domínguez-Martín
, Hipólito Hernández-Pérez
, Jorge Riera-Ledesma
, Inmaculada Rodríguez Martín
:
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Comput. Oper. Res. 161: 106426 (2024) - Elisabeth Gaar
, Diane Puges
, Angelika Wiegele
:
Strong SDP based bounds on the cutwidth of a graph. Comput. Oper. Res. 161: 106449 (2024) - Juan-Carlos García-Vélez, Diego Ruiz-Hernández
, José-Fernando Camacho-Vallejo
, Juan A. Díaz:
Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem. Comput. Oper. Res. 161: 106418 (2024) - Matthieu Gruson
, Jean-François Cordeau
, Raf Jans
:
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem. Comput. Oper. Res. 161: 106434 (2024) - Dung T. K. Ha
, Canh V. Pham
, Tan D. Tran:
Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Comput. Oper. Res. 161: 106452 (2024) - Bin Ji, Shujing Zhang, Samson S. Yu, Xin Xiao, Chen Chen, Guohua Zheng:
Novel model and solution method for flexible job shop scheduling problem with batch processing machines. Comput. Oper. Res. 161: 106442 (2024) - Hao Jiang, Weili Zeng, Wenbin Wei
, Xianghua Tan:
A bilevel flight collaborative scheduling model with traffic scenario adaptation: An arrival prior perspective. Comput. Oper. Res. 161: 106431 (2024) - Boris Kogan
, Tatyana Chernonog, Avi Herbon:
Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource. Comput. Oper. Res. 161: 106440 (2024) - Arie M. C. A. Koster
, Jenny Segschneider, Nicole Ventsch:
Γ-robust optimization of project scheduling problems. Comput. Oper. Res. 161: 106453 (2024) - Robert H. Lee, Alex Kuiper
:
Optimal sequencing using a scheduling heuristic. Comput. Oper. Res. 161: 106405 (2024) - Yun Hui Lin
, Qingyun Tian
, Dongdong He, Yuan Wang
:
Revisiting Stackelberg p-median problem with user preferences. Comput. Oper. Res. 161: 106429 (2024) - Ming Liu, Hao Tang, Feng Chu, Yueyu Ding, Feifeng Zheng, Chengbin Chu
:
A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network. Comput. Oper. Res. 161: 106422 (2024) - Roshan Mahes
, Michel Mandjes
, Marko Boon
:
Adaptive appointment scheduling with periodic updates. Comput. Oper. Res. 161: 106437 (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) - Gonzalo Méndez-Vogel
, Vladimir Marianov, Pascual Fernández
, Blas Pelegrín, Armin Lüer-Villagra
:
Sequential customers' decisions in facility location with comparison-shopping. Comput. Oper. Res. 161: 106448 (2024) - Timothy Mulumba
, Waleed Najy
, Ali Diabat:
The drone-assisted pickup and delivery problem: An adaptive large neighborhood search metaheuristic. Comput. Oper. Res. 161: 106435 (2024) - Megan Muniz, Tülay Flamand
:
A column generation approach for the team formation problem. Comput. Oper. Res. 161: 106406 (2024)
skipping 15 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/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-12 01:07 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