Mathematical Programming Algorithms for Spatial Cloaking

DOI10.1287/IJOC.2018.0813MaRDI QIDQ5137955zbMATH OpenOpenAlexWikidataFDO

Authors Alberto Ceselli, Maria Luisa Damiani, Diego Valorsi, Giovanni Righini

Publication date 3 December 2020

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8995dcb2ab60fed3a5097b1c47fa956a355c80a1

zbMATH Keywords

branch and cutbranch and priceSteiner trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Exact disclosure prevention in two-dimensional statistical tables
• Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
• Branch-and-cut algorithms for Steiner tree problems with privacy conflicts
• Differentially private combinatorial optimization
• Optimal Steiner trees under node and edge privacy conflicts

Cites work

• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• On implementing the push-relabel method for the maximum flow problem
• SCIP: solving constraint integer programs
• Solving Steiner tree problems in graphs to optimality
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut

Cited in

(1)

• On combining conventional point-to-point and automated waste collection systems

Describes a project that uses

Uses Software

• SCIP
• SteinLib
• MAXFLOW

This page was built for publication: Mathematical Programming Algorithms for Spatial Cloaking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137955)