default search action
Tolga Bektas
Person information
- affiliation: University of Liverpool, UK
- affiliation (former): University of Southampton, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j63]Fuliang Wu, Hongbo Ye, Tolga Bektas, Ming Dong:
New and tractable formulations for the eco-driving and the eco-routing-and-driving problems. Eur. J. Oper. Res. 321(2): 445-461 (2025) - 2024
- [j62]Carlos Lamas-Fernandez
, Antonio Martinez-Sykora
Improving last-mile parcel delivery through shared consolidation and portering: A case study in London. J. Oper. Res. Soc. 75(6): 1043-1054 (2024) - 2023
- [j61]Christopher Bayliss
Designing a multi-modal and variable-echelon delivery system for last-mile logistics. Eur. J. Oper. Res. 307(2): 645-662 (2023) - [j60]Farnaz Farzadnia
The cumulative school bus routing problem: Polynomial-size formulations. Networks 82(4): 571-591 (2023) - 2022
- [j59]Mohammad Rahim Akhavan Kazemzadeh, Tolga Bektas
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. Discret. Appl. Math. 308: 255-275 (2022) - 2020
- [j58]Phuoc Hoang Le, Tri-Dung Nguyen
Efficient computation of the Shapley value for large-scale linear production games. Ann. Oper. Res. 287(2): 761-781 (2020) - [j57]Antonio Martinez-Sykora
Optimised solutions to the last-mile delivery problem in London using a combination of walking and driving. Ann. Oper. Res. 295(2): 645-693 (2020) - [j56]Tolga Bektas
Using ℓp-norms for fairness in combinatorial optimisation. Comput. Oper. Res. 120: 104975 (2020) - [j55]Tolga Bektas
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. Comput. Oper. Res. 124: 105084 (2020) - [j54]Tolga Bektas
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem. J. Sched. 23(4): 513-523 (2020) - [c11]Tolga Bektas:
Last-Mile Logistics in Urban Areas. SMARTGREENS 2020: 7 - [c10]Tolga Bektas:
Last-Mile Logistics in Urban Areas. VEHITS 2020: 9
2010 – 2019
- 2019
- [j53]Ramez Kian
Optimal spare parts management for vessel maintenance scheduling. Ann. Oper. Res. 272(1-2): 323-353 (2019) - [j52]Okan Dukkanci
The green location-routing problem. Comput. Oper. Res. 105: 187-202 (2019) - [j51]Tolga Bektas
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. Eur. J. Oper. Res. 273(2): 452-463 (2019) - [j50]Tolga Bektas
The role of operational research in green freight transportation. Eur. J. Oper. Res. 274(3): 807-823 (2019) - [j49]Tolga Bektas
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm. Eur. J. Oper. Res. 276(1): 40-64 (2019) - [j48]Thu Ba T. Nguyen
Optimising parcel deliveries in London using dual-mode routing. J. Oper. Res. Soc. 70(6): 998-1010 (2019) - [c9]Sarah Wise, Kostas Cheliotis
Park And Parcel: An Agent-Based Exploration Of Last-Mile Freight Delivery Behavior As It Relates To Parking. SpringSim 2019: 1-10 - 2018
- [j47]Moncef Ilies Nasri, Tolga Bektas
Route and speed optimization for autonomous trucks. Comput. Oper. Res. 100: 89-101 (2018) - [j46]Murat Oguz, Tolga Bektas
Multicommodity flows and Benders decomposition for restricted continuous location problems. Eur. J. Oper. Res. 266(3): 851-863 (2018) - [j45]Tolga Bektas
Disjunctive Programming for Multiobjective Discrete Optimisation. INFORMS J. Comput. 30(4): 625-633 (2018) - [j44]Tommaso Adamo
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows. Transp. Sci. 52(4): 739-755 (2018) - [c8]Oliver Bates
Transforming Last-mile Logistics: Opportunities for more Sustainable Deliveries. CHI 2018: 526 - [c7]Oliver Bates
ICT for Sustainable Last-Mile Logistics: Data, People and Parcels. ICT4S 2018: 49-67 - 2017
- [j43]Sener Akpinar
Combinatorial Benders cuts for assembly line balancing problems with setups. Eur. J. Oper. Res. 259(2): 527-537 (2017) - [j42]Fulin Xie
Iterated local search for workforce scheduling and routing problems. J. Heuristics 23(6): 471-500 (2017) - [j41]Tolga Bektas
New path elimination constraints for multi-depot routing problems. Networks 70(3): 246-261 (2017) - [c6]Bo Dong, Tolga Bektas
A New Formulation for the Combined Maritime Fleet Deployment and Inventory Management Problem. ICCL 2017: 321-335 - [e1]Tolga Bektas, Stefano Coniglio, Antonio Martinez-Sykora, Stefan Voß:
Computational Logistics - 8th International Conference, ICCL 2017, Southampton, UK, October 18-20, 2017, Proceedings. Lecture Notes in Computer Science 10572, Springer 2017, ISBN 978-3-319-68495-6 [contents] - 2016
- [j40]Phuoc Hoang Le, Tri-Dung Nguyen
Generalized minimum spanning tree games. EURO J. Comput. Optim. 4(2): 167-188 (2016) - [j39]Çagri Koç, Tolga Bektas
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. Eur. J. Oper. Res. 248(1): 33-51 (2016) - [j38]Çagri Koç, Tolga Bektas
Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1): 1-21 (2016) - [j37]Dimitris C. Paraskevopoulos, Tolga Bektas
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. Eur. J. Oper. Res. 253(2): 265-279 (2016) - [j36]Xiaozhou Zhao, Julia A. Bennell
A comparative review of 3D container loading algorithms. Int. Trans. Oper. Res. 23(1-2): 287-320 (2016) - [j35]Renan Tunalioglu, Çagri Koç, Tolga Bektas
A multiperiod location-routing problem arising in the collection of Olive Oil Mill Wastewater. J. Oper. Res. Soc. 67(7): 1012-1024 (2016) - [j34]Murat Oguz, Tolga Bektas
A modelling framework for solving restricted planar location problems using phi-objects. J. Oper. Res. Soc. 67(8): 1080-1096 (2016) - 2015
- [j33]Tolga Bektas
Integrated vehicle routing problems. Comput. Oper. Res. 55: 126 (2015) - [j32]Çagri Koç, Tolga Bektas
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res. 64: 11-27 (2015) - [j31]Günes Erdogan
Matheuristics for solving a multi-attribute collection problem for a charity organisation. J. Oper. Res. Soc. 66(2): 177-190 (2015) - [j30]Tolga Bektas
Optimal vehicle routing with lower and upper bounds on route durations. Networks 65(2): 166-179 (2015) - 2014
- [j29]Angel A. Juan
Routing fleets with multiple driving ranges: Is it possible to use greener fleet configurations? Appl. Soft Comput. 21: 84-94 (2014) - [j28]Emrah Demir
The bi-objective Pollution-Routing Problem. Eur. J. Oper. Res. 232(3): 464-478 (2014) - [j27]Tolga Bektas
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? Eur. J. Oper. Res. 236(3): 820-832 (2014) - [j26]Emrah Demir
A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3): 775-793 (2014) - [j25]Angel A. Juan
A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs. Simul. Model. Pract. Theory 46: 40-52 (2014) - [p2]Tolga Bektas, Panagiotis P. Repoussis, Christos D. Tarantilis:
Dynamic Vehicle Routing Problems. Vehicle Routing 2014: 299-347 - [p1]Richard Eglese, Tolga Bektas:
Green Vehicle Routing. Vehicle Routing 2014: 437-458 - 2013
- [j24]Alistair R. Clark, Tolga Bektas, Jim Freeman:
Editorial. OR Insight 26(4): 219 (2013) - [c5]Tolga Bektas
Balancing tour durations in routing a vehicle fleet. CIPLS 2013: 9-16 - 2012
- [j23]Tolga Bektas
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing. Eur. J. Oper. Res. 216(1): 83-93 (2012) - [j22]Emrah Demir
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem. Eur. J. Oper. Res. 223(2): 346-359 (2012) - [c4]José Cáceres-Cruz, Angel A. Juan
Combining Monte Carlo simulation with heuristics for solving the inventory routing problem with stochastic demands. WSC 2012: 274:1-274:9 - [c3]Angel A. Juan, Barry B. Barrios, Sergio González-Martín, Javier Faulin, Mariana E. Cóccola, Tolga Bektas:
Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem. WSC 2012: 347:1-347:2 - 2011
- [j21]Tanutr Rienthong, Andrew Walker, Tolga Bektas
Look, here comes the library van! Optimising the timetable of the mobile library service on the Isle of Wight. OR Insight 24(1): 49-62 (2011) - [j20]Tolga Bektas
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem. Transp. Sci. 45(3): 299-316 (2011) - 2010
- [j19]Tolga Bektas
Editorial. J. Oper. Res. Soc. 61(3): 502 (2010) - [j18]J. Bauer, Tolga Bektas
Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design. J. Oper. Res. Soc. 61(3): 530-542 (2010) - [j17]Tolga Bektas
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints. Networks 55(3): 171-180 (2010) - [j16]Alistair R. Clark, Jim Freeman, Tolga Bektas:
Editorial. OR Insight 23(3): 151-153 (2010)
2000 – 2009
- 2009
- [j15]Steve Ah kioon, Akif Asil Bulgak, Tolga Bektas
Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration. Eur. J. Oper. Res. 192(2): 414-428 (2009) - [j14]Alistair R. Clark, Jim Freeman, Tolga Bektas:
Editorial. OR Insight 22(1): 1 (2009) - [j13]Alistair R. Clark, Jim Freeman, Tolga Bektas:
Editorial. OR Insight 22(3): 125-126 (2009) - 2008
- [j12]Tolga Bektas
Exact algorithms for the joint object placement and request routing problem in content distribution networks. Comput. Oper. Res. 35(12): 3860-3884 (2008) - [j11]Tolga Bektas
Lagrangean-based solution approaches for the generalized problem of locating capacitated warehouses. Int. Trans. Oper. Res. 15(1): 67-85 (2008) - [j10]Tolga Bektas
A two-level simulated annealing algorithm for efficient dissemination of electronic content. J. Oper. Res. Soc. 59(11): 1557-1567 (2008) - 2007
- [j9]Tolga Bektas
On separating cover inequalities for the multidimensional knapsack problem. Comput. Oper. Res. 34(6): 1771-1776 (2007) - [j8]Tolga Bektas
Designing cost-effective content distribution networks. Comput. Oper. Res. 34(8): 2436-2449 (2007) - [j7]Tolga Bektas
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem. Eur. J. Oper. Res. 182(1): 455-465 (2007) - [j6]Ghislain Dubuc, Jean-François Cordeau, Gilbert Laporte, Tolga Bektas
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique. INFOR Inf. Syst. Oper. Res. 45(3): 175-185 (2007) - [j5]Tolga Bektas
Solving school bus routing problems through integer programming. J. Oper. Res. Soc. 58(12): 1599-1604 (2007) - 2006
- [j4]Imdat Kara, Tolga Bektas
Integer linear programming formulations of multiple salesman problems and its variations. Eur. J. Oper. Res. 174(3): 1449-1458 (2006) - [j3]Tolga Bektas
A novel optimization algorithm for video placement and routing. IEEE Commun. Lett. 10(2): 114-116 (2006) - [j2]Berna Dengiz, Tolga Bektas
Simulation optimization based DSS application: A diamond tool production line in industry. Simul. Model. Pract. Theory 14(3): 296-312 (2006) - 2005
- [c2]Onur Özkök, Fatma Pakdil, Fahri Bugra Çamlica, Tolga Bektas
A Pathway for Process Improvement Activities in a Production Environment: A Case Study in a Rework Department. Business Process Management 2005: 344-353 - [c1]Imdat Kara, Tolga Bektas
Minimal Load Constrained Vehicle Routing Problems. International Conference on Computational Science (1) 2005: 188-195 - 2004
- [j1]Imdat Kara, Gilbert Laporte, Tolga Bektas
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158(3): 793-795 (2004)
Coauthor Index
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.
last updated on 2024-12-09 23:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: