Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Cire, Andre A."'
U.S. presidential elections are decided by the Electoral College, established in 1789, and designed to mitigate potential risks arising from the collusion of large groups of citizens. A statewide winner-take-all popular voting system for electors is
Externí odkaz:
http://arxiv.org/abs/2410.00697
We investigate relaxations for a class of discrete bilevel programs where the interaction constraints linking the leader and the follower are linear. Our approach reformulates the upper-level optimality constraints by projecting the leader's decision
Externí odkaz:
http://arxiv.org/abs/2407.18193
Many discrete optimization problems are amenable to constrained shortest-path reformulations in an extended network space, a technique that has been key in convexification, bound strengthening, and search. In this paper, we propose a constrained vari
Externí odkaz:
http://arxiv.org/abs/2206.12962
This paper develops a memory-efficient approach for Sequential Pattern Mining (SPM), a fundamental topic in knowledge discovery that faces a well-known memory bottleneck for large data sets. Our methodology involves a novel hybrid trie data structure
Externí odkaz:
http://arxiv.org/abs/2202.06834
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems. Many techniques now use DDs as a key tool to achieve state-of-the-art performance within other optim
Externí odkaz:
http://arxiv.org/abs/2201.11536
This paper investigates sequencing policies for file reading requests in linear storage devices, such as magnetic tapes. Tapes are the technology of choice for long-term storage in data centers due to their low cost and reliability. However, their ph
Externí odkaz:
http://arxiv.org/abs/2112.07018
This paper presents and evaluates two pruning techniques to reinforce the efficiency of constraint optimization solvers based on multi-valued decision-diagrams (MDD). It adopts the branch-and-bound framework proposed by Bergman et al. in 2016 to solv
Externí odkaz:
http://arxiv.org/abs/2104.11951
We study the problem when a firm sets prices for products based on the transaction data, i.e., which product past customers chose from an assortment and what were the historical prices that they observed. Our approach does not impose a model on the d
Externí odkaz:
http://arxiv.org/abs/2101.02251
Autor:
Cappart, Quentin, Moisan, Thierry, Rousseau, Louis-Martin, Prémont-Schwarz, Isabeau, Cire, Andre
Combinatorial optimization has found applications in numerous fields, from aerospace to transportation planning and economics. The goal is to find an optimal solution among a finite set of possibilities. The well-known challenge one faces with combin
Externí odkaz:
http://arxiv.org/abs/2006.01610