Privacy-preserving horizontally partitioned linear programs with inequality constraints
From MaRDI portal
Publication:1936802
DOI10.1007/S11590-011-0403-2zbMATH Open1261.90025OpenAlexW2070787726MaRDI QIDQ1936802FDOQ1936802
Authors: Wei Li, Haohao Li, Chongyang Deng
Publication date: 7 February 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0403-2
Recommendations
- Privacy-preserving horizontally partitioned linear programs
- An inference-proof approach to privacy-preserving horizontally partitioned linear programs
- Privacy-preserving vertically partitioned linear program with nonnegativity constraints
- Privacy-preserving linear programming
- Privacy-preserving linear and nonlinear approximation via linear programming
- Privately solving linear programs
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- scientific article; zbMATH DE number 6402149
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
Cites Work
Cited In (7)
- Privacy-preserving vertically partitioned linear program with nonnegativity constraints
- Privacy-preserving linear programming
- Privacy-preserving horizontally partitioned linear programs
- Consensus-based Dantzig-Wolfe decomposition
- Privately solving linear programs
- An inference-proof approach to privacy-preserving horizontally partitioned linear programs
- Masking primal and dual models for data privacy in network revenue management
This page was built for publication: Privacy-preserving horizontally partitioned linear programs with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936802)