Twenty-five years of hub location research

JF Campbell, ME O'Kelly - Transportation Science, 2012 - pubsonline.informs.org
Last year was the 25th anniversary of two seminal transportation hub location publications,
which appeared in 1986 in Transportation Science and Geographical Analysis. Though …

Solving Steiner trees: Recent advances, challenges, and perspectives

I Ljubić - Networks, 2021 - Wiley Online Library
The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …

The electric vehicle touring problem

CS Liao, SH Lu, ZJM Shen - Transportation Research Part B …, 2016 - Elsevier
The increasing concern over global warming has led to the rapid development of the electric
vehicle industry. Electric vehicles (EVs) have the potential to reduce the greenhouse effect …

[HTML][HTML] MIP models for connected facility location: A theoretical and computational study

S Gollowitzer, I Ljubić - Computers & Operations Research, 2011 - Elsevier
This article comprises the first theoretical and computational study on mixed integer
programming (MIP) models for the connected facility location problem (ConFL). ConFL …

Lagrangean relaxation algorithms for fixed-charge capacitated relay network design

P Kewcharoenwong, Q Li, H Üster - Omega, 2023 - Elsevier
We consider a fixed-charge capacitated relay network design problem (CRNDP), which has
widespread applications in the design of telecommunication and transportation networks …

A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing

O Arslan, OE Karaşan, AR Mahjoub… - Transportation …, 2019 - pubsonline.informs.org
Because of the limited range of alternative fuel vehicles (AFVs) and the sparsity of the
available alternative refueling stations (AFSs), AFV drivers cooperatively deviate from their …

Minimum cost path problem for plug-in hybrid electric vehicles

O Arslan, B Yıldız, OE Karaşan - Transportation Research Part E: Logistics …, 2015 - Elsevier
We introduce a practically important and theoretically challenging problem: finding the
minimum cost path for PHEVs in a road network with refueling and charging stations. We …

Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem

B Gendron, A Lucena, AS da Cunha… - INFORMS Journal on …, 2014 - pubsonline.informs.org
We present exact algorithms for solving the minimum connected dominating set problem in
an undirected graph. The algorithms are based on two approaches: a Benders …

On the complexity of the regenerator placement problem in optical networks

M Flammini, A Marchetti Spaccamela… - Proceedings of the …, 2009 - dl.acm.org
Placement of regenerators in optical networks has attracted the attention of recent research
works in optical networks. In this problem we are given a network, with an underlying …

Minimizing total busy time in parallel scheduling with application to optical networks

M Flammini, G Monaco, L Moscardelli… - Theoretical Computer …, 2010 - Elsevier
We consider a scheduling problem in which a bounded number of jobs can be processed
simultaneously by a single machine. The input is a set of n jobs J={J1,…, Jn}. Each job, Jj, is …