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 30 matches
- 2018
- Hamid Allaoui, Yuhan Guo, Alok Choudhary, Jacqueline M. Bloemhof:
Sustainable agro-food supply chain design using two-stage hybrid multi-objective decision-making approach. Comput. Oper. Res. 89: 369-384 (2018) - Meral Azizoglu, Sadullah Imat:
Workload smoothing in simple assembly line balancing. Comput. Oper. Res. 89: 51-57 (2018) - Sujatha Babu, Usha Mohan:
An integrated approach to evaluating sustainability in supply chains using evolutionary game theory. Comput. Oper. Res. 89: 269-283 (2018) - Ruibin Bai, John R. Woodward, Nachiappan Subramanian, John Cartlidge:
Optimisation of transportation service network using κ-node large neighbourhood search. Comput. Oper. Res. 89: 193-205 (2018) - Narges Banaeian, Hossein Mobli, Behnam Fahimnia, Izabela Ewa Nielsen, Mahmoud Omid:
Green supplier selection using fuzzy group decision making methods: A case study from the agri-food industry. Comput. Oper. Res. 89: 337-347 (2018) - Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle:
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm. Comput. Oper. Res. 89: 94-112 (2018) - Elahe Boudaghi, Reza Farzipoor Saen:
Developing a novel model of data envelopment analysis-discriminant analysis for predicting group membership of suppliers in sustainable supply chain. Comput. Oper. Res. 89: 348-359 (2018) - Hadi Charkhgard, Martin W. P. Savelsbergh, Masoud Talebian:
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints. Comput. Oper. Res. 89: 17-30 (2018) - Pedro Correia, Luís Paquete, José Rui Figueira:
Compressed data structures for bi-objective {0, 1}-knapsack problems. Comput. Oper. Res. 89: 82-93 (2018) - Kevin Dalmeijer, Remy Spliet:
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Comput. Oper. Res. 89: 140-152 (2018) - Dileep Dhavale, Joseph Sarkis:
Stochastic internal rate of return on investments in sustainable assets generating carbon credits. Comput. Oper. Res. 89: 324-336 (2018) - Hadas Elalouf, Moshe Kaspi, Amir Elalouf, Ilan Halachmi:
Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: Simulation and response surface methodology. Comput. Oper. Res. 89: 230-240 (2018) - Behnam Fahimnia, Hoda Davarzani, Ali Eshragh:
Planning of complex supply chains: A performance comparison of three meta-heuristic algorithms. Comput. Oper. Res. 89: 241-252 (2018) - Angappa Gunasekaran, Nachiappan Subramanian:
Sustainable operations modeling and data analytics. Comput. Oper. Res. 89: 163-167 (2018) - Vipul Gupta, Gopalakrishnan Narayanamurthy, Padmanav Acharya:
Can lean lead to green? Assessment of radial tyre manufacturing processes using system dynamics modelling. Comput. Oper. Res. 89: 284-306 (2018) - Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov:
Corridor-based metro network design with travel flow capture. Comput. Oper. Res. 89: 58-67 (2018) - Seyedeh Zahra Hosseinifard, Babak Abbasi:
The inventory centralization impacts on sustainability of the blood supply chain. Comput. Oper. Res. 89: 206-212 (2018) - Yohanes Kristianto, Angappa Gunasekaran:
A global optimization for sustainable multi-domain global manufacturing. Comput. Oper. Res. 89: 307-323 (2018) - Xin Ma, Ping Ji, William Ho, Cheng-Hu Yang:
Optimal procurement decision with a carbon tax for the manufacturing industry. Comput. Oper. Res. 89: 360-368 (2018) - Sakthivel Madankumar, Chandrasekharan Rajendran:
Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain. Comput. Oper. Res. 89: 183-192 (2018) - Avinash Malik, Cameron G. Walker, Michael J. O'Sullivan, Oliver Sinnen:
Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay. Comput. Oper. Res. 89: 113-126 (2018) - Zhaowei Miao, Huiqiang Mao, Ke Fu, Yu Wang:
Remanufacturing with trade-ins under carbon regulations. Comput. Oper. Res. 89: 253-268 (2018) - Calwin S. Parthibaraj, Nachiappan Subramanian, PL. K. Palaniappan, Kee-hung Lai:
Sustainable decision model for liner shipping industry. Comput. Oper. Res. 89: 213-229 (2018) - Thomas D. van Pelt, Jan C. Fransoo:
A note on "Linear programming models for a stochastic dynamic capacitated lot sizing problem". Comput. Oper. Res. 89: 13-16 (2018) - Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo:
Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. 89: 31-50 (2018) - Mehmet Soysal, Jacqueline Bloemhof-Ruwaard, René Haijema, Jack G. A. J. van der Vorst:
Modeling a green inventory routing problem for perishable products with horizontal collaboration. Comput. Oper. Res. 89: 168-182 (2018) - Túlio A. M. Toffolo, Jan Christiaens, Sam Van Malderen, Tony Wauters, Greet Vanden Berghe:
Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89: 68-81 (2018) - Fabien Tricoire, Judith Scagnetti, Andreas Beham:
New insights on the block relocation problem. Comput. Oper. Res. 89: 127-139 (2018) - Tianjiao Zhang, Liangjun Ke, Jing Li, Jisheng Li, Jingqi Huang, Zexi Li:
Metaheuristics for the tabu clustered traveling salesman problem. Comput. Oper. Res. 89: 1-12 (2018) - Chengliang Zhang, George L. Nemhauser, Joel Sokol, Myun-Seok Cheon, Ahmet B. Keha:
Flexible solutions to maritime inventory routing problems with delivery time windows. Comput. Oper. Res. 89: 153-162 (2018)
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-10-11 08:19 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