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 21 matches
- 2020
- Harry Aguilar, Alberto García-Villoria, Rafael Pastor:
A survey of the parallel assembly lines balancing problem. Comput. Oper. Res. 124: 105061 (2020) - Tolga Bektas, Luís Gouveia, Daniel Santos:
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. Comput. Oper. Res. 124: 105084 (2020) - Reinhard Bürgy, Alain Hertz, Pierre Baptiste:
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Comput. Oper. Res. 124: 105063 (2020) - Herminia I. Calvete, Carmen Galé, José A. Iranzo, José-Fernando Camacho-Vallejo, Martha-Selene Casas-Ramírez:
A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences. Comput. Oper. Res. 124: 105066 (2020) - Paola Cappanera, Cristina Requejo, Maria Grazia Scutellà:
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques. Comput. Oper. Res. 124: 105054 (2020) - Ming Chen, Zhi-Long Chen:
Optimal pricing to minimize maximum regret with limited demand information. Comput. Oper. Res. 124: 105070 (2020) - Ying Chen, Feng Liu, Jay M. Rosenberger, Victoria C. P. Chen, Asama Kulvanitchaiyanunt, Yuan Zhou:
Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization. Comput. Oper. Res. 124: 105032 (2020) - Zeynel Abidin Çil, Damla Kizilay:
Constraint programming model for multi-manned assembly line balancing problem. Comput. Oper. Res. 124: 105069 (2020) - Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy, Hoang Giang Pham, Thuy Do, Louis-Martin Rousseau:
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints. Comput. Oper. Res. 124: 105085 (2020) - Mohammad Abdul Hoque, Arijit Bhattacharya:
A manufacturer-buyers integrated inventory model with generic distribution of lead times to deliver equal and/or unequal batch sizes. Comput. Oper. Res. 124: 105047 (2020) - Bo Jin:
A note on "An exact algorithm for the blocks relocation problem with new lower bounds". Comput. Oper. Res. 124: 105082 (2020) - Herbert Jodlbauer, Matthias Dehmer:
An extension of the reorder point method by using advance demand spike information. Comput. Oper. Res. 124: 105055 (2020) - Ibrahim Kucukkoc:
Balancing of two-sided disassembly lines: Problem definition, MILP model and genetic algorithm approach. Comput. Oper. Res. 124: 105064 (2020) - Chi-Shiuan Lin, Pei-Yi Li, Jun-Min Wei, Muh-Cherng Wu:
Integration of process planning and scheduling for distributed flexible job shops. Comput. Oper. Res. 124: 105053 (2020) - Jue Liu, Zhan Pang, Linggang Qi:
Dynamic pricing and inventory management with demand learning: A bayesian approach. Comput. Oper. Res. 124: 105078 (2020) - Ruilin Ouyang, Chun-An Chou:
Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data. Comput. Oper. Res. 124: 105049 (2020) - Carlo S. Sartori, Luciana S. Buriol:
A study on the pickup and delivery problem with time windows: Matheuristics and new instances. Comput. Oper. Res. 124: 105065 (2020) - Everton Fernandes da Silva, Aline Aparecida de Souza Leão, Franklina Maria Bragion Toledo, Tony Wauters:
A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints. Comput. Oper. Res. 124: 105058 (2020) - Thomas Ullmert, Stefan Ruzika, Anita Schöbel:
On the p-hub interdiction problem. Comput. Oper. Res. 124: 105056 (2020) - Jonathan De La Vega, Pedro Munari, Reinaldo Morabito:
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen. Comput. Oper. Res. 124: 105062 (2020) - Tao Wu, Zhongshun Shi, Zhe Liang, Xiaoning Zhang, Canrong Zhang:
Dantzig-Wolfe decomposition for the facility location and production planning problem. Comput. Oper. Res. 124: 105068 (2020)
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-01 17:24 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