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 44 matches
- 2024
- Dilay Aktas, Evert Vermeir, Pieter Vansteenwegen:
Speeding up the Passenger Assignment Problem in transit planning by the Direct Link Network representation. Comput. Oper. Res. 167: 106647 (2024) - Paulina Kus Ariningsih, Chandra Ade Irawan, Antony Paulraj, Jing Dai:
A multi-period vaccines supply chain network design with capacity expansion and different replenishment cycles under uncertain demand. Comput. Oper. Res. 167: 106660 (2024) - Ha-Bang Ban, Huynh Thi Thanh Binh, Tuan Anh Do, Cong Dao Tran, Su Nguyen:
A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems. Comput. Oper. Res. 167: 106622 (2024) - Stefano Benati, Eduardo Conde:
A robust ordered weighted averaging loss model for portfolio optimization. Comput. Oper. Res. 167: 106666 (2024) - Debajyoti Biswas, Laurent Alfandari, Claudia Archetti:
A Triple Bottom Line optimization model for assignment and routing of on-demand home services. Comput. Oper. Res. 167: 106644 (2024) - Hayo Bos, Richard J. Boucherie, Erwin W. Hans, Gréanne Leeftink:
Distributionally robust scheduling of stochastic knapsack arrivals. Comput. Oper. Res. 167: 106641 (2024) - Paolo Brandimarte, Edoardo Fadda:
A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times. Comput. Oper. Res. 167: 106634 (2024) - Jan Bart Broekaert, Davide La Torre, Faizal M. F. Hafiz, Marco Repetto:
A comparative cost assessment of coalescing epidemic control strategies in heterogeneous social-contact networks. Comput. Oper. Res. 167: 106680 (2024) - Kuo-Hao Chang, Chien-Chi Hsu, Wen-Ray Su:
An agent-based simulation framework for emergency evacuations from toxic gas incidents and an empirical study in Taiwan. Comput. Oper. Res. 167: 106645 (2024) - Anna Livia Croella, Bjørnar Luteberget, Carlo Mannino, Paolo Ventura:
A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems. Comput. Oper. Res. 167: 106679 (2024) - Florian Delavernhe, Bruno Castanier, Christelle Guéret, Jorge E. Mendoza:
The joint maintenance operation selection and technician routing problem. Comput. Oper. Res. 167: 106667 (2024) - Okan Dukkanci, James F. Campbell, Bahar Yetis Kara:
Facility location decisions for drone delivery with riding: A literature review. Comput. Oper. Res. 167: 106672 (2024) - Abdelhak Elidrissi, Rachid Benmansour, Keramat Hasani, Frank Werner:
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations. Comput. Oper. Res. 167: 106638 (2024) - Josef Grus, Zdenek Hanzálek:
Automated placement of analog integrated circuits using priority-based constructive heuristic. Comput. Oper. Res. 167: 106643 (2024) - Fang Guo, Yan Xu, Zhihong Huang, Yunxiang Wu:
Collaborative optimization of routing and storage strategy of multi-period multimodal transport in an uncertain environment. Comput. Oper. Res. 167: 106676 (2024) - R.-Julius O. Heitmann, Ninja Soeffker, Frank Klawonn, Marlin W. Ulmer, Dirk C. Mattfeld:
Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions. Comput. Oper. Res. 167: 106639 (2024) - Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita Schöbel, Reena Urban:
The Bus Rapid Transit investment problem. Comput. Oper. Res. 167: 106640 (2024) - Chandra Ade Irawan, Saïd Salhi, Dylan F. Jones, Jing Dai, Martin J. Liu:
A dry port hub-and-spoke network design: An optimization model, solution method, and application. Comput. Oper. Res. 167: 106646 (2024) - Yu Jiang:
A variational inequality formulation for stochastic user equilibrium with a bounded choice set. Comput. Oper. Res. 167: 106677 (2024) - Panagiotis Karakostas, Angelo Sifaleras:
The pollution traveling salesman problem with refueling. Comput. Oper. Res. 167: 106661 (2024) - Steven Lamontagne, Margarida Carvalho, Ribal Atallah:
Accelerated Benders decomposition and local branching for dynamic maximum covering location problems. Comput. Oper. Res. 167: 106673 (2024) - Yitian Li, Xinyi Li, Canrong Zhang, Tao Wu:
Decomposition algorithms for the robust unidirectional quay crane scheduling problems. Comput. Oper. Res. 167: 106670 (2024) - Mateus Martin, Thiago Alves de Queiroz, Reinaldo Morabito:
Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming model. Comput. Oper. Res. 167: 106651 (2024) - Adriano Masone, Mauro Russo, Claudio Sterle:
Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting. Comput. Oper. Res. 167: 106490 (2024) - Luka Matijevic, Vladimir Ilin, Tatjana Davidovic, Tatjana Jaksic Krüger, Panos M. Pardalos:
General VNS for asymmetric vehicle routing problem with time and capacity constraints. Comput. Oper. Res. 167: 106630 (2024) - Fanchao Meng, Xuequan Zhou, Xuefeng Piao, Dianhui Chu:
Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model. Comput. Oper. Res. 167: 106662 (2024) - Rahimeh Neamatian Monemi, Shahin Gelareh, Nelson Maculan:
Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic. Comput. Oper. Res. 167: 106604 (2024) - Jacob Nitter, Shusheng Yang, Kjetil Fagerholt, Andreas Breivik Ormevik:
The static ridesharing routing problem with flexible locations: A Norwegian case study. Comput. Oper. Res. 167: 106669 (2024) - Joris Slootweg, Rob van der Mei, Caroline J. Jagtenberg, Frank Ottenhof:
Centralized multi-visitor trip planning with activity reservations in crowded destinations. Comput. Oper. Res. 167: 106633 (2024) - Willy Chandra Sugianto, Byung Soo Kim:
Iterated variable neighborhood search for integrated scheduling of additive manufacturing and multi-trip vehicle routing problem. Comput. Oper. Res. 167: 106659 (2024)
skipping 14 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-11-27 23:13 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