A combinatorial optimization approach to the selection of statistical units
From MaRDI portal
Publication:747022
DOI10.3934/jimo.2016.12.515zbMath1327.90407OpenAlexW2516925083MaRDI QIDQ747022
Gianpiero Bianchi, Alessandra Reale, Renato Bruni
Publication date: 22 October 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.515
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Enumerative combinatorics (05A99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting planes in integer and mixed integer programming
- Data mining in agriculture
- Discrete models for data imputation
- Some new results on multi-dimension Knapsack problem
- Balancing of agricultural census data by using discrete optimization
- Completeness and Unbiased Estimation for Sum-Quota Sampling
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Polynomially Computable Bounds for the Probability of the Union of Events
- Error correction for massive datasets
- Best Possible Inequalities for the Probability of a Logical Function of Events
This page was built for publication: A combinatorial optimization approach to the selection of statistical units