David Bergman

According to our database1, David Bergman authored at least 34 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the Consistent Path Problem.
Oper. Res., 2020

Generating Longest Counterexample: On the Cross-roads of Mixed Integer Linear Programming and SMT.
Proceedings of the 2020 American Control Conference, 2020

2019
On the Minimum Chordal Completion Polytope.
Oper. Res., 2019

An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating.
INFORMS J. Comput., 2019

JANOS: An Integrated Predictive and Prescriptive Modeling Framework.
CoRR, 2019

Template-based Minor Embedding for Adiabatic Quantum Optimization.
CoRR, 2019

Last-Mile Scheduling Under Uncertainty.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Discrete Nonlinear Optimization by State-Space Decompositions.
Manag. Sci., 2018

Predictive and Prescriptive Analytics for Location Selection of Add-on Retail Products.
CoRR, 2018

Network Models for Multiobjective Discrete Optimization.
CoRR, 2018

The Integrated Last-Mile Transportation Problem (ILMTP).
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Surviving a National Football League Survivor Pool.
Oper. Res., 2017

On Finding the Optimal BDD Relaxation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Decision Diagrams for Optimization
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-42849-9, 2016

Discrete Optimization with Decision Diagrams.
INFORMS J. Comput., 2016

Theoretical insights and algorithmic tools for decision diagram-based optimization.
Constraints An Int. J., 2016

Decompositions Based on Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Decomposition Based on Decision Diagrams.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Multiobjective Optimization by Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
Lagrangian bounds from decision diagrams.
Constraints An Int. J., 2015

New techniques for discrete optimization.
Constraints An Int. J., 2015

A Benders Approach to the Minimum Chordal Completion Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Improved Constraint Propagation via Lagrangian Decomposition.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
MDD Propagation for Sequence Constraints.
J. Artif. Intell. Res., 2014

Optimization Bounds from Binary Decision Diagrams.
INFORMS J. Comput., 2014

BDD-based heuristics for binary optimization.
J. Heuristics, 2014

Graph coloring inequalities from all-different systems.
Constraints An Int. J., 2014

Parallel Combinatorial Optimization with Decision Diagrams.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Optimization Bounds from Binary Decision Diagrams - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

2012
Graph Coloring Facets from All-Different Systems.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
Manipulating MDD Relaxations for Combinatorial Optimization.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011


  Loading...