6 citations · 6 across the 3 of their papers we have counts for
3 papers
Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
Leonardo Lozano, David Bergman, Andre Augusto Cire
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…
On Approximate Sequencing Policies for Linear Storage Devices
Carlos H. Cardonha, Andre A. Cire, Lucas C. Villa Real
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…
On the Minimum Chordal Completion Polytope
David Bergman, Carlos H. Cardonha, Andre A. Cire +1
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in…