A Memory-Efficient Algorithm for Conservative Cuts in Disjoint Bilinear Programming
This paper presents a memory-efficient approach to the combinatorial challenges associated with the process in search of conservative cuts for degeneracy removal in disjoint bilinear programming. Drawing inspiration from Pascal’s Triangle, the new randomized approach surpasses its predecessor from...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Scientia Publishing House
2024-10-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://acta.sapientia.ro/content/docs/info16-1-02-114879.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|