XXIV Congresso da Associação Portuguesa de Investigação Operacional (IO2025)

Session

Session 5.3 - Hard optimization problems

Not scheduled

Room 3

54. A mathematical formulation for the imaging and communication scheduling problem for super-agile Earth observation satellites

Margarida Caleiras (uc.pt)

Apresentação regular

Earth Observation Satellites (EOSs) are designed to collect images of Earth’s surface for a wide range of applications, such as disaster response, environmental monitoring and resource management. With the increasing number of orbiting EOSs, efficient scheduling of satellite operations has become a critical challenge. To ensure effective use of these complex systems, it is essential to develop...

81. A Novel Derivative-Free Method with Improved Complexity for Nonsmooth Convex and Strongly Convex Optimization

Rohollah Garmanjani (NOVA Math, NOVA FCT, NOVA University Lisbon)

Apresentação regular

Derivative-free methods—also known as black-box or zero-order methods—are crucial when derivative information is unavailable or unreliable. We introduce a novel algorithm that, for nonsmooth convex objectives, achieves a worst-case complexity bound proportional to the inverse square of a specified accuracy tolerance—substantially improving over a previously developed method in the literature....

29. New ideas on Monte Carlo tree search for optimization

João Pedro Pedroso (up.pt)

Apresentação regular

Monte Carlo tree search (MCTS) has shown significant success in game playing, achieving state-of-the-art results in many complex domains. While there are known applications in optimization, they often don't fully capitalize on the problem-specific knowledge available. This work addresses this gap by proposing adaptations of MCTS tailored for optimization problems. We focus on enhancing the...

113. Sobre clutters minimalmente não ideais

Paulo Monteiro (Departamento de Matemática da Universidade de Aveiro)

Apresentação regular

Um {\em clutter\/} é um par ${\cal C} \equiv (V,E)$, onde $E$ (os elementos de $\Cl$) denota uma família de subconjuntos, de um conjunto não vazio e finito $V$ (os vértices de $\Cl$),
tal que nenhum dos elementos está contido noutro.
A teoria de clutters, outrora referida como {\em blocking\/} e {\em antiblocking\/} (Fulkerson'70), permite abordar, de modo elegante, questões diversas...