Mathematical Programming Algorithms for Spatial Cloaking

DOI10.1287/ijoc.2018.0813OpenAlexW2902567655WikidataQ128857816 ScholiaQ128857816MaRDI QIDQ5137955

Alberto Ceselli, Diego Valorsi, Maria Luisa Damiani, 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 cutSteiner treesbranch and price

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• SCIP
• SteinLib
• MAXFLOW

Cites Work

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

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