Mathematical programming algorithms for spatial cloaking
Year of publication: |
2018
|
---|---|
Authors: | Ceselli, Alberto ; Damiani, Maria Luisa ; Righini, Giovanni ; Valorsi, Diego |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 4, p. 710-723
|
Subject: | Steiner trees | branch and price | branch and cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Leitner, Markus, (2018)
-
An exact cutting plane method for the Euclidean max-sum diversity problem
Spiers, Sandy, (2023)
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
- More ...
-
A Column Generation Algorithm for a Rich Vehicle-Routing Problem
Ceselli, Alberto, (2009)
-
Ceselli, Alberto, (2009)
-
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
Ceselli, Alberto, (2008)
- More ...