The Pareto cover problem
From MaRDI portal
Cites work
- An integer programming approach for linear programs with probabilistic constraints
- Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
- Convex Approximations of Chance Constrained Programs
- The complexity of counting in sparse, regular, and planar graphs
This page was built for publication: The Pareto cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969598)