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 …
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
Operational Research: methods and applications
Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …
models and algorithms that have been applied to a wide range of contexts. This …
[图书][B] Introduction to location science
This chapter introduces modern Location Science. It traces the roots of the area and
describes the path leading to the full establishment of this research field. It identifies several …
describes the path leading to the full establishment of this research field. It identifies several …
Redesigning Benders decomposition for large-scale facility location
The uncapacitated facility location (UFL) problem is one of the most famous and most
studied problems in the operations research literature. Given a set of potential facility …
studied problems in the operations research literature. Given a set of potential facility …
A tailored Benders decomposition approach for last-mile delivery with autonomous robots
L Alfandari, I Ljubić, MDM da Silva - European Journal of Operational …, 2022 - Elsevier
This work addresses an operational problem of a logistics service provider that consists of
finding an optimal route for a vehicle carrying customer parcels from a central depot to …
finding an optimal route for a vehicle carrying customer parcels from a central depot to …
General network design: A unified view of combined location and network design problems
I Contreras, E Fernández - European Journal of Operational Research, 2012 - Elsevier
This paper presents a unified framework for the general network design problem which
encompasses several classical problems involving combined location and network design …
encompasses several classical problems involving combined location and network design …
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
We consider a family of competitive facility location problems in which a “newcomer”
company enters the market and has to decide where to locate a set of new facilities so as to …
company enters the market and has to decide where to locate a set of new facilities so as to …
Recent molecularly imprinted polymers applications in bioanalysis
FM Suzaei, SM Daryanavard, A Abdel-Rehim… - Chemical Papers, 2023 - Springer
Molecular imprinted polymers (MIPs) as extraordinary compounds with unique features have
presented a wide range of applications and benefits to researchers. In particular when used …
presented a wide range of applications and benefits to researchers. In particular when used …
Minimizing the maximum travel time in a combined model of facility location and network design
This paper presents a combined Facility Location/Network Design Problem which
simultaneously considers the location of facilities and the design of its underlying network so …
simultaneously considers the location of facilities and the design of its underlying network so …
Bi-sided facility location problems: an efficient algorithm for k-centre, k-median, and travelling salesman problems
This study introduces a general framework, called Bi-sided facility location, for a wide range
of problems in the area of combined facility location and routing problems such as locating …
of problems in the area of combined facility location and routing problems such as locating …