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 40 matches
- 2014
- Rachida Abounacer, Monia Rekik, Jacques Renaud:
An exact solution approach for multi-objective location-transportation problem for disaster response. Comput. Oper. Res. 41: 83-93 (2014) - Deniz Aksen, Sema Sengül Akca, Necati Aras:
A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput. Oper. Res. 41: 346-358 (2014) - Natalia Alguacil, Andrés Delgadillo, José Manuel Arroyo:
A trilevel programming approach for electric grid defense planning. Comput. Oper. Res. 41: 282-290 (2014) - Le Thi Hoai An, Duc Manh Nguyen, Tao Pham Dinh:
A DC programming approach for planning a multisensor multizone search for a target. Comput. Oper. Res. 41: 231-239 (2014) - Eusebio Angulo, Enrique F. Castillo, Ricardo García-Ródenas, Jesús Sánchez-Vizcaíno:
A continuous bi-level model for the expansion of highway networks. Comput. Oper. Res. 41: 262-276 (2014) - Laura Silva de Assis, Paulo Morelato França, Fábio Luiz Usberti:
A redistricting problem applied to meter reading in power distribution networks. Comput. Oper. Res. 41: 65-75 (2014) - Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41: 167-173 (2014) - Kenneth R. Baker:
Setting optimal due dates in a basic safe-scheduling model. Comput. Oper. Res. 41: 109-114 (2014) - Ross Baldick, Dhiman Chatterjee:
Coordinated dispatch of regional transmission organizations: Theory and example. Comput. Oper. Res. 41: 319-332 (2014) - Tobias Buer, Herbert Kopfer:
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction. Comput. Oper. Res. 41: 208-220 (2014) - Robert L. Burdett, Erhan Kozan:
Determining operations affected by delay in predictive train timetables. Comput. Oper. Res. 41: 150-166 (2014) - Enrique F. Castillo, José María Menéndez, Santos Sánchez-Cambronero, Aida Calvino, José María Sarabia:
A hierarchical optimization problem: Estimating traffic flow using Gamma random variables in a Bayesian context. Comput. Oper. Res. 41: 240-251 (2014) - Suh-Wen Chiou:
Optimization of robust area traffic control with equilibrium flow under demand uncertainty. Comput. Oper. Res. 41: 399-411 (2014) - Federico Della Croce, Michele Garraffa:
The Selective Fixing Algorithm for the closest string problem. Comput. Oper. Res. 41: 24-30 (2014) - Stephan Dempe, Susanne Franke:
Solution algorithm for an optimistic linear Stackelberg problem. Comput. Oper. Res. 41: 277-281 (2014) - Belmiro P. M. Duarte, Angelos Tsoukalas:
Solving quality control problems with an algorithm for minimax programs with coupled constraints. Comput. Oper. Res. 41: 223-230 (2014) - José Fernández, Saïd Salhi, Boglárka G.-Tóth:
Location equilibria for a continuous competitive facility location problem under delivered pricing. Comput. Oper. Res. 41: 185-195 (2014) - François Gilbert, Patrice Marcotte, Gilles Savard:
Logit network pricing. Comput. Oper. Res. 41: 291-298 (2014) - Mihalis M. Golias, Isabel Portal, Dinçer Konur, Evangelos Kaisar, Georgios Kolomvos:
Robust berth scheduling at marine container terminals via hierarchical optimization. Comput. Oper. Res. 41: 412-422 (2014) - Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Block models for scheduling jobs on two parallel machines with a single server. Comput. Oper. Res. 41: 94-97 (2014) - Vahid Kayvanfar, G. M. Komaki, Amin Aalaei, Mostafa Zandieh:
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput. Oper. Res. 41: 31-43 (2014) - Jong Soo Kim, Sung Il Park, Ki Young Shin:
A quantity flexibility contract model for a system with heterogeneous suppliers. Comput. Oper. Res. 41: 98-108 (2014) - Mercedes Landete, Alfredo Marín:
Looking for edge-equitable spanning trees. Comput. Oper. Res. 41: 44-52 (2014) - Daniele Manerba, Renata Mansini:
An effective matheuristic for the capacitated total quantity discount problem. Comput. Oper. Res. 41: 1-11 (2014) - Renaud Masson, Fabien Lehuédé, Olivier Péton:
The Dial-A-Ride Problem with Transfers. Comput. Oper. Res. 41: 12-23 (2014) - Julien Michallet, Christian Prins, Lionel Amodeo, Farouk Yalaoui, Grégoire Vitry:
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput. Oper. Res. 41: 196-207 (2014) - Baruch Mor, Gur Mosheiov:
Batch scheduling of identical jobs with controllable processing times. Comput. Oper. Res. 41: 115-124 (2014) - Jenny Nossack, Erwin Pesch:
A branch-and-bound algorithm for the acyclic partitioning problem. Comput. Oper. Res. 41: 174-184 (2014) - Javad Sadeghi, Saeid Sadeghi, Seyed Taghi Akhavan Niaki:
A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters. Comput. Oper. Res. 41: 53-64 (2014) - Georgios K. D. Saharidis, Antonio J. Conejo, George Kozanidis:
Preface. Comput. Oper. Res. 41: 221-222 (2014)
skipping 10 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-20 01:42 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