The thesis wants to study the problem of the admissibility of Integer Linear Programming (ILP) with sparse columns, i.e. with variables that appear in "few" inequalities. The focus will be on the case in which each variable can appear in at most two inequalities, a case whose computational complexity is still unknown.
La tesi vuole studiare il problema dell'ammissibilità per la Programmazione Lineare Intera (ILP) con colonne sparse, ossia con variabili che compaiono in “poche” disequazioni. Il focus sarà in particolare sul caso in cui ogni variabile possa comparire al più in due disequazioni, caso del quale tuttora non si conosce la complessità computazionale.
Integer Linear Programming with Sparse Columns
GHILARDI, ANDREA
2022/2023
Abstract
The thesis wants to study the problem of the admissibility of Integer Linear Programming (ILP) with sparse columns, i.e. with variables that appear in "few" inequalities. The focus will be on the case in which each variable can appear in at most two inequalities, a case whose computational complexity is still unknown.File | Dimensione | Formato | |
---|---|---|---|
GhilardiAndrea.pdf
accesso riservato
Dimensione
971.59 kB
Formato
Adobe PDF
|
971.59 kB | Adobe PDF |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
https://hdl.handle.net/20.500.12608/61365