Zobrazeno 1 - 10
of 252
pro vyhledávání: '"d'Ambrosio, Claudia"'
In this work, we aim to compare different methods and formulations to solve a problem in air traffic management to global optimality. In particular, we focus on the aircraft deconfliction problem, where we are given n aircraft, their position at time
Externí odkaz:
http://arxiv.org/abs/2406.17403
Autor:
Xu, Liding, D'Ambrosio, Claudia
We study the continuous set covering problem on networks and propose several new MILP formulations and valid inequalities. In contrast to state-of-the-art formulations, the new formulations only use edges to index installed points, and the formulatio
Externí odkaz:
http://arxiv.org/abs/2404.10467
Publikováno v:
In: Pardalos, P.M., Prokopyev, O.A. (eds) Encyclopedia of Optimization. Springer, Cham. (2023)
The field of algorithmic optimization has significantly advanced with the development of methods for the automatic configuration of algorithmic parameters. This article delves into the Algorithm Configuration Problem, focused on optimizing parametriz
Externí odkaz:
http://arxiv.org/abs/2403.00898
We discuss the issue of finding a good mathematical programming solver configuration for a particular instance of a given problem, and we propose a two-phase approach to solve it. In the first phase we learn the relationships between the instance, th
Externí odkaz:
http://arxiv.org/abs/2401.05041
We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and configurations in order to learn a performance function of the solver. Sec
Externí odkaz:
http://arxiv.org/abs/2401.04237
As the share of variable renewable energy sources increases in the electricity mix, new solutions are needed to build a flexible and reliable grid. Energy arbitrage with battery storage systems supports renewable energy integration into the grid by s
Externí odkaz:
http://arxiv.org/abs/2305.04566
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, we discuss the generation of cutting planes for signomial programming.
Externí odkaz:
http://arxiv.org/abs/2212.02857
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with separable non-convex functions via the Sequential Convex MINLP technique, an iterative method whose main characteristic is that of solving, for bound
Externí odkaz:
http://arxiv.org/abs/2211.15450
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular. SMBP is equivalent to chance-constrained and robust bin packing problems under vari
Externí odkaz:
http://arxiv.org/abs/2204.00320
Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models only deal with fitting continuous functions. In this paper, we investigate the problem of fitting a discontinuo
Externí odkaz:
http://arxiv.org/abs/2001.08275