Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bienstock, Daniel
7  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Power Network Design with Line Activity:

, In: AIRO Springer Series; Optimization in Artificial Intelligence and Data Sciences,
Bienstock, Daniel ; Cerulli, Martina ; Escobar, Mauro. - p. 185-198 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Complexity, Exactness, and Rationality in Polynomial Optimi..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Bienstock, Daniel ; Del Pia, Alberto ; Hildebrand, Robert - p. 58-72 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Intersection Cuts for Polynomial Optimization:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Bienstock, Daniel ; Chen, Chen ; Muñoz, Gonzalo - p. 72-87 , 2019
Link: https://doi.org/10.1007/..
 
?
4

Polynomial solvability of variants of the trust-region subp..:

, In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms,
Bienstock, Daniel ; Michalka, Alexander - p. 380-390 , 2014
Link: https://dl.acm.org/doi/1..
 
?
5

ε-Approximate linear programs : new bounds and computati..:

, In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms,
Bienstock, Daniel - p. 1-2 , 2000
Link: https://dl.acm.org/doi/1..
 
?
6

Some provably hard crossing number problems:

, In: Proceedings of the sixth annual symposium on Computational geometry,
Bienstock, Daniel - p. 253-260 , 1990
Link: https://dl.acm.org/doi/1..
 
?
7

On Linear Communication Complexity for (Maximally) Fluid MP:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Bienstock, Alexander ; Escudero, Daniel ; Polychroniadou, Antigoni - p. 263-294 , 2023
Link: https://doi.org/10.1007/..
 
1-7