A5010179547- Advanced Optimization Algorithms Research
- Advanced Optical Network Technologies
- Complexity and Algorithms in Graphs
- Vehicle Routing Optimization Methods
- Software-Defined Networks and 5G
- Optimization and Mathematical Programming
- Network Traffic and Congestion Control
- Optimization and Packing Problems
- Risk and Portfolio Optimization
- Advanced Control Systems Optimization
- Mobile Ad Hoc Networks
- Interconnection Networks and Systems
- VLSI and FPGA Design Techniques
- Formal Methods in Verification
- Optimization and Variational Analysis
- Computational Geometry and Mesh Generation
- Supply Chain and Inventory Management
- Optimization and Search Problems
- Facility Location and Emergency Management
- Optical Network Technologies
- Advanced Graph Theory Research
- Markov Chains and Monte Carlo Methods
- Sparse and Compressive Sensing Techniques
- Advanced Multi-Objective Optimization Algorithms
- Machine Learning and Algorithms
Politecnico di Milano
2004-2024
Clemson University
2010-2013
Lehigh University
2009-2011
Carnegie Mellon University
2007-2009
Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions nonlinear system dynamics that affect the quality of final design or plan. These lead to mixed-integer programming (MINLP) combine combinatorial difficulty optimizing over variable sets with challenges handling functions. We review models MINLP, survey state art methods for solving this challenging class problems. Most solution MINLP apply some form tree search....
Abstract Many industrial problems can be naturally formulated using mixed integer non-linear programming (MINLP) models and solved by spatial Branch&Bound (sBB) techniques. We study the impact of two important parts sBB methods: bounds tightening (BT) branching strategies. extend a technique originally developed for MILP, reliability branching, to MINLP case. Motivated demand open-source solvers real-world problems, we have an software package named couenne (Convex Over- Under-ENvelopes...
Abstract We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given set of terminals must communicate with one another, and possible matrices, sufficient capacity has to be reserved on the links large underlying public support all matrices while minimizing total reservation cost. The admits several versions depending desired topology links, nature data uncertainty. present compact linear mixed‐integer programming...