A5046766268- Advanced Optimization Algorithms Research
- Complexity and Algorithms in Graphs
- Optimization and Mathematical Programming
- Formal Methods in Verification
- Error Correcting Code Techniques
- VLSI and Analog Circuit Testing
- Advanced Control Systems Optimization
- Control Systems and Identification
- Polynomial and algebraic computation
- Stochastic Gradient Optimization Techniques
- Bayesian Modeling and Causal Inference
- VLSI and FPGA Design Techniques
- Optimal Experimental Design Methods
- Interconnection Networks and Systems
- Machine Learning and Algorithms
- Cryptography and Data Security
- Fault Detection and Control Systems
- Advanced Multi-Objective Optimization Algorithms
- Scheduling and Optimization Algorithms
Universitat Politècnica de Catalunya
2011-2023
Institut d'Estadística de Catalunya
2006-2008
The cell-suppression problem (CSP) is a very large mixed-integer linear arising in statistical disclosure control. However, CSP has the typical structure that allows application of Benders decomposition, which known to suffer from oscillation and slow convergence, compounded with fact master combinatorial. To overcome this drawback, we present stabilized decomposition whose restricted neighborhood successful candidates by local-branching constraints, are dynamically adjusted, even dropped,...
Abstract As a heuristic for obtaining feasible points of mixed integer linear problems, the feasibility pump (FP) generates two sequences points: one solutions relaxed problem; and another obtained by rounding solutions. In previous work, present authors proposed variant FP, named analytic center which obtains in segment between solution polyhedron problem. This work introduces new FP that replaces with Chebyshev center. Two benefits using are: (i) it requires optimization problem (unlike...