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 36 matches
- 2024
- Moustafa Abdelwanis, Adriana F. Gabor, Nenad Mladenovic, Andrei Sleptchenko:
Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories. Comput. Oper. Res. 164: 106546 (2024) - Luca Accorsi, Daniele Vigo:
Routing one million customers in a handful of minutes. Comput. Oper. Res. 164: 106562 (2024) - Zacharie Alès, Valentine Huré, Amélie Lambert:
New optimization models for optimal classification trees. Comput. Oper. Res. 164: 106515 (2024) - Giovanna Abreu Alves, Iago Pinheiro de Freitas, Victor Claudio Bento de Camargo:
A surrogate-based heuristic for production planning problem of orders in small foundries. Comput. Oper. Res. 164: 106560 (2024) - Silvia Baldassarre, Giuseppe Bruno, Ioannis Giannikos, Carmela Piccolo:
A two-level Hierarchical Nested Cooperative Location model. Comput. Oper. Res. 164: 106519 (2024) - Robin C. Ball, Juergen Branke, Stephan Meisel:
Re-use of samples in stochastic annealing. Comput. Oper. Res. 164: 106543 (2024) - Yulle G. F. Borges, Rafael C. S. Schouery, Flávio Keidi Miyazawa:
Mathematical models and exact algorithms for the Colored Bin Packing Problem. Comput. Oper. Res. 164: 106527 (2024) - Martin Branda, Monika Matousková:
A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes. Comput. Oper. Res. 164: 106542 (2024) - Florian Delavernhe:
Multi-objective search game: Long-term vs short-term. Comput. Oper. Res. 164: 106551 (2024) - Yutong Gao, Shu Zhang, Zhiwei Zhang, Quanwu Zhao:
The stochastic share-a-ride problem with electric vehicles and customer priorities. Comput. Oper. Res. 164: 106550 (2024) - Ricardo García-Ródenas, María Luz López-García, Luis Cadarso, Esteve Codina:
An efficient greedy heuristic for the real-time train platforming problem. Comput. Oper. Res. 164: 106525 (2024) - Qian-Ping Gu, Jiajian Leo Liang:
Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles. Comput. Oper. Res. 164: 106529 (2024) - Mikhail Y. Kovalyov, Katarzyna Anna Kuzmicz, Mikhail N. Lukashevich, Erwin Pesch:
Planning container inspection and repair: A case study. Comput. Oper. Res. 164: 106555 (2024) - David S. W. Lai, Yasel Costa, Emrah Demir, Alexandre M. Florio, Tom Van Woensel:
The pollution-routing problem with speed optimization and uneven topography. Comput. Oper. Res. 164: 106557 (2024) - Xiang Li, Xiaojie An, Bowen Zhang:
Minimizing passenger waiting time in the multi-route bus fleet allocation problem through distributionally robust optimization and reinforcement learning. Comput. Oper. Res. 164: 106568 (2024) - Zhi Lu, Jian Gao, Jin-Kao Hao, Pingle Yang, Lixin Zhou:
Learning driven three-phase search for the maximum independent union of cliques problem. Comput. Oper. Res. 164: 106549 (2024) - Shaojun Lu, Chongyao Ma, Xinbao Liu, Panos M. Pardalos:
Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search algorithm. Comput. Oper. Res. 164: 106552 (2024) - Arthur Mahéo, Simon Belieres, Yossiri Adulyasak, Jean-François Cordeau:
Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs. Comput. Oper. Res. 164: 106526 (2024) - Lissa Melis, Michell F. Queiroz, Kenneth Sörensen:
The integrated on-demand bus routing problem: Combining on-demand buses with a high-frequency fixed line public transport network. Comput. Oper. Res. 164: 106554 (2024) - Lukas Metz, Petra Mutzel, Tim Niemann, Lukas Schürmann, Sebastian Stiller, Andreas M. Tillmann:
Delay-resistant robust vehicle routing with heterogeneous time windows. Comput. Oper. Res. 164: 106553 (2024) - Carlos Obreque, Germán Paredes-Belmar, Pablo A. Miranda Gonzalez, Giovanni Campuzano, Gabriel Gutiérrez-Jarpa:
Modeling and solving the two-level generalized median tour problem. Comput. Oper. Res. 164: 106558 (2024) - Valentín Pando, Luis Augusto San-José, Joaquín Sicilia, David Alcaide López de Pablo:
An inventory model with price- and stock-dependent demand and time- and stock quantity-dependent holding cost under profitability maximization. Comput. Oper. Res. 164: 106520 (2024) - Marcos W. J. Servare, Helder R. de Oliveira Rocha, José Leandro Felix Salles:
A smart energy scheduling under uncertainties of an iron ore stockyard-port system using a rolling horizon algorithm. Comput. Oper. Res. 164: 106518 (2024) - Victor Anselmo Silva, Akang Wang, Virgílio José Martins Ferreira Filho, Chrysanthos E. Gounaris:
Routing and scheduling of platform supply vessels in offshore oil and gas logistics. Comput. Oper. Res. 164: 106556 (2024) - Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran:
Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP). Comput. Oper. Res. 164: 106530 (2024) - Jeeu Fong Sze, Saïd Salhi, Niaz A. Wassan:
An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem. Comput. Oper. Res. 164: 106531 (2024) - Hongtao Tang, Wei Zhang, Xixing Li, Shupeng Wei:
A discrete group teaching optimization algorithm for solving many-objective sand casting whole process production scheduling problem. Comput. Oper. Res. 164: 106563 (2024) - Shing Chih Tsai, Yingchieh Yeh, Honggang Wang, Tsung Ching Chou:
Efficient optimization in stochastic production planning problems with product substitution. Comput. Oper. Res. 164: 106544 (2024) - Shiping Wu, Hongguang Bo, Chun Jin, Xiaobing Liu:
Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand. Comput. Oper. Res. 164: 106523 (2024) - Peng Wu, Yun Wang, Chengbin Chu:
Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption. Comput. Oper. Res. 164: 106528 (2024)
skipping 6 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-12-17 16:59 CET 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