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 …
Imposing contiguity constraints in political districting models
Beginning in the 1960s, techniques from operations research began to be used to generate
political districting plans. A classical example is the integer programming model of Hess et …
political districting plans. A classical example is the integer programming model of Hess et …
Strategies for coordinated multirobot exploration with recurrent connectivity constraints
During several applications, such as search and rescue, robots must discover new
information about the environment and, at the same time, share operational knowledge with …
information about the environment and, at the same time, share operational knowledge with …
Mathematical optimization ideas for biodiversity conservation
A Billionnet - European Journal of Operational Research, 2013 - Elsevier
Several major environmental issues like biodiversity loss and climate change currently
concern the international community. These topics that are related to the development of …
concern the international community. These topics that are related to the development of …
On imposing connectivity constraints in integer programs
In many network applications, one searches for a connected subset of vertices that exhibits
other desirable properties. To this end, this paper studies the connected subgraph polytope …
other desirable properties. To this end, this paper studies the connected subgraph polytope …
Asynchronous multirobot exploration under recurrent connectivity constraints
In multirobot exploration under centralized control, communication plays an important role in
constraining the team exploration strategy. Recurrent connectivity is a way to define …
constraining the team exploration strategy. Recurrent connectivity is a way to define …
New formulations for two location problems with interconnected facilities
Y Kuzbakov, I Ljubić - European Journal of Operational Research, 2024 - Elsevier
This paper studies two location problems with interconnected facilities. In the first problem,
all customers need to be served by open facilities, and in the second (covering) variant a …
all customers need to be served by open facilities, and in the second (covering) variant a …
Optimizing the geometry of wildlife corridors in conservation reserve design
R St John, SF Tóth, ZB Zabinsky - Operations Research, 2018 - pubsonline.informs.org
Wildlife corridors are often used to connect critical habitat for species protection. Mixed
integer programming models have been used in the past to create wildlife corridors, but they …
integer programming models have been used in the past to create wildlife corridors, but they …
Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
Borne out of a surprising variety of practical applications, the maximum-weight connected
subgraph problem has attracted considerable interest in recent years. This interest has not …
subgraph problem has attracted considerable interest in recent years. This interest has not …
The generalized reserve set covering problem with connectivity and buffer requirements
The design of nature reserves is becoming, more and more, a crucial task for ensuring the
conservation of endangered wildlife. In order to guarantee the preservation of species and a …
conservation of endangered wildlife. In order to guarantee the preservation of species and a …