( en | de | ru )

 

Disambiguation of "Bergman, David"

Author of the publication

copydeleteadd this publication to your clipboard
Last-Mile Scheduling Under Uncertainty.

, , , , and . CPAIOR, volume 11494 of Lecture Notes in Computer Science, page 519-528. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Solveig Bergman

Keren Bergman

Svante Bergman

Sabina Bergman

Ruth Bergman

 

Other publications of authors with the same name

On the Minimum Chordal Completion Polytope., , , and . CoRR, (2016)Last-Mile Scheduling Under Uncertainty., , , , and . CPAIOR, volume 11494 of Lecture Notes in Computer Science, page 519-528. Springer, (2019)On Finding the Optimal BDD Relaxation., and . CPAIOR, volume 10335 of Lecture Notes in Computer Science, page 41-50. Springer, (2017)A Benders Approach to the Minimum Chordal Completion Problem., and . CPAIOR, volume 9075 of Lecture Notes in Computer Science, page 47-64. Springer, (2015)Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation., , and . CPAIOR, volume 11494 of Lecture Notes in Computer Science, page 57-66. Springer, (2019)Maximizing student opportunities for in-person classes under pandemic capacity reductions., , and . Decis. Support Syst., (2022)Acceleration techniques for optimization over trained neural network ensembles., , , and . CoRR, (2021)MORBDD: Multiobjective Restricted Binary Decision Diagrams by Learning to Sparsify., , and . CoRR, (2024)Decision Diagram Decomposition for Quadratically Constrained Binary Optimization., and . INFORMS J. Comput., 33 (1): 401-418 (2021)New techniques for discrete optimization.. Constraints An Int. J., 20 (4): 486-487 (2015)