Solving the distance-based critical node problem
Year of publication: |
2022
|
---|---|
Authors: | Salemi, Hosseinali ; Buchanan, Austin |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 3, p. 1309-1326
|
Subject: | branch-and-cut | critical node | distance constraint | dominant | integer program | network interdiction | partial dominant | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Tourenplanung | Vehicle routing problem |
-
Gouveia, Luis, (2017)
-
Online algorithms for the multi-vehicle inventory-routing problem with real-time demands
Bertazzi, Luca, (2023)
-
An optimal algorithm for variable knockout problems
Beasley, John E., (2024)
- More ...
-
On fault-tolerant low-diameter clusters in graphs
Lu, Yajun, (2022)
-
Salemi, Hosseinali, (2023)
-
Solving unsplittable network flow problems with decision diagrams
Salemi, Hosseinali, (2023)
- More ...