default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Bergman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Mohsen Emadikhiav, Sudip Bhattacharjee, Robert Day, David Bergman:
A decision support framework for integrated lane identification and long-term backhaul collaboration using spatial analytics and optimization. Decis. Support Syst. 180: 114186 (2024)- [j23]Arvind U. Raghunathan, David Bergman
, John N. Hooker, Thiago Serra, Shingo Kobori:
Seamless Multimodal Transportation Scheduling. INFORMS J. Comput. 36(2): 336-358 (2024) - [i14]Rahul Patel, Elias B. Khalil, David Bergman:
MORBDD: Multiobjective Restricted Binary Decision Diagrams by Learning to Sparsify. CoRR abs/2403.02482 (2024) - [i13]Jeff Decary, David Bergman, Carlos Cardonha, Jason Imbrogno, Andrea Lodi:
The Madness of Multiple Entries in March Madness. CoRR abs/2407.13438 (2024) - 2023
- [j22]David Bergman, Carlos Cardonha, Jason Imbrogno, Leonardo Lozano:
Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution. INFORMS J. Comput. 35(2): 304-317 (2023) - [j21]Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman:
Optimizing over an Ensemble of Trained Neural Networks. INFORMS J. Comput. 35(3): 652-674 (2023) - [i12]Manish Goyal, David Bergman, Parasara Sridhar Duggirala:
BDD for Complete Characterization of a Safety Violation in Linear Systems with Inputs. CoRR abs/2311.15343 (2023) - 2022
- [j20]Carlos Cardonha, David Bergman, Robert Day:
Maximizing student opportunities for in-person classes under pandemic capacity reductions. Decis. Support Syst. 154: 113697 (2022) - [j19]Thiago Serra, Teng Huang, Arvind U. Raghunathan, David Bergman:
Template-Based Minor Embedding for Adiabatic Quantum Optimization. INFORMS J. Comput. 34(1): 427-439 (2022) - [j18]David Bergman, Teng Huang, Philip Brooks, Andrea Lodi, Arvind U. Raghunathan:
JANOS: An Integrated Predictive and Prescriptive Modeling Framework. INFORMS J. Comput. 34(2): 807-816 (2022) - [j17]David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. INFORMS J. Comput. 34(2): 990-1005 (2022) - [j16]Saharnaz Mehrani, Carlos Cardonha, David Bergman:
Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation. INFORMS J. Comput. 34(2): 1070-1085 (2022) - [j15]Quentin Cappart, David Bergman, Louis-Martin Rousseau, Isabeau Prémont-Schwarz, Augustin Parjadis:
Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning. INFORMS J. Comput. 34(5): 2552-2570 (2022) - [i11]Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano, David Bergman:
Careful! Training Relevance is Real. CoRR abs/2201.04429 (2022) - [i10]Leonardo Lozano, David Bergman, André A. Ciré:
Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization. CoRR abs/2206.12962 (2022) - [i9]Arvind U. Raghunathan, Carlos Cardonha, David Bergman, Carlos J. Nohra:
Recursive McCormick Linearization of Multilinear Programs. CoRR abs/2207.08955 (2022) - 2021
- [j14]David Bergman, Leonardo Lozano:
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization. INFORMS J. Comput. 33(1): 401-418 (2021) - [c18]Keliang Wang, Leonardo Lozano, David Bergman, Carlos Cardonha:
A Two-Stage Exact Algorithm for Optimization of Neural Network Ensemble. CPAIOR 2021: 106-114 - [c17]Augustin Parjadis, Quentin Cappart, Louis-Martin Rousseau, David Bergman:
Improving Branch-and-Bound Using Decision Diagrams and Reinforcement Learning. CPAIOR 2021: 446-455 - [i8]Keliang Wang, Leonardo Lozano, Carlos Cardonha, David Bergman:
Acceleration techniques for optimization over trained neural network ensembles. CoRR abs/2112.07007 (2021) - 2020
- [j13]Leonardo Lozano, David Bergman, J. Cole Smith:
On the Consistent Path Problem. Oper. Res. 68(6): 1913-1931 (2020) - [c16]Manish Goyal, David Bergman, Parasara Sridhar Duggirala:
Generating Longest Counterexample: On the Cross-roads of Mixed Integer Linear Programming and SMT. ACC 2020: 1823-1829
2010 – 2019
- 2019
- [j12]David Bergman:
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating. INFORMS J. Comput. 31(3): 477-492 (2019) - [j11]David Bergman, Carlos Henrique Cardonha, André Augusto Ciré, Arvind U. Raghunathan:
On the Minimum Chordal Completion Polytope. Oper. Res. 67(2): 532-547 (2019) - [c15]Quentin Cappart, Emmanuel Goutierre, David Bergman, Louis-Martin Rousseau:
Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning. AAAI 2019: 1443-1451 - [c14]David Bergman, Carlos Cardonha, Saharnaz Mehrani:
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation. CPAIOR 2019: 57-66 - [c13]Thiago Serra, Arvind U. Raghunathan, David Bergman, John N. Hooker, Shingo Kobori:
Last-Mile Scheduling Under Uncertainty. CPAIOR 2019: 519-528 - [i7]Thiago Serra, Teng Huang, Arvind U. Raghunathan, David Bergman:
Template-based Minor Embedding for Adiabatic Quantum Optimization. CoRR abs/1910.02179 (2019) - [i6]David Bergman, Teng Huang, Philip Brooks, Andrea Lodi, Arvind U. Raghunathan:
JANOS: An Integrated Predictive and Prescriptive Modeling Framework. CoRR abs/1911.09461 (2019) - 2018
- [j10]David Bergman, André A. Ciré:
Discrete Nonlinear Optimization by State-Space Decompositions. Manag. Sci. 64(10): 4700-4720 (2018) - [c12]Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra, Shingo Kobori:
The Integrated Last-Mile Transportation Problem (ILMTP). ICAPS 2018: 388-398 - [i5]David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. CoRR abs/1802.08637 (2018) - [i4]Teng Huang, David Bergman, Ram D. Gopal:
Predictive and Prescriptive Analytics for Location Selection of Add-on Retail Products. CoRR abs/1804.01182 (2018) - [i3]Quentin Cappart, Emmanuel Goutierre, David Bergman, Louis-Martin Rousseau:
Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning. CoRR abs/1809.03359 (2018) - [i2]David Bergman, Carlos Cardonha, Saharnaz Mehrani:
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation. CoRR abs/1812.00059 (2018) - 2017
- [j9]David Bergman, Jason Imbrogno:
Surviving a National Football League Survivor Pool. Oper. Res. 65(5): 1343-1354 (2017) - [c11]David Bergman, André Augusto Ciré:
On Finding the Optimal BDD Relaxation. CPAIOR 2017: 41-50 - 2016
- [b1]David Bergman, André A. Ciré, Willem-Jan van Hoeve, John N. Hooker:
Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer 2016, ISBN 978-3-319-42847-5, pp. 1-234 - [j8]David Bergman, André Augusto Ciré:
Theoretical insights and algorithmic tools for decision diagram-based optimization. Constraints An Int. J. 21(4): 533-556 (2016) - [j7]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve, John N. Hooker:
Discrete Optimization with Decision Diagrams. INFORMS J. Comput. 28(1): 47-66 (2016) - [c10]David Bergman, André Augusto Ciré:
Multiobjective Optimization by Decision Diagrams. CP 2016: 86-95 - [c9]David Bergman, André A. Ciré:
Decomposition Based on Decision Diagrams. CPAIOR 2016: 45-54 - [c8]David Bergman:
Decompositions Based on Decision Diagrams. ISAIM 2016 - [i1]David Bergman, Carlos Henrique Cardonha, André Augusto Ciré, Arvind U. Raghunathan:
On the Minimum Chordal Completion Polytope. CoRR abs/1612.01966 (2016) - 2015
- [j6]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve:
Lagrangian bounds from decision diagrams. Constraints An Int. J. 20(3): 346-361 (2015) - [j5]David Bergman:
New techniques for discrete optimization. Constraints An Int. J. 20(4): 486-487 (2015) - [c7]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve:
Improved Constraint Propagation via Lagrangian Decomposition. CP 2015: 30-38 - [c6]David Bergman, Arvind U. Raghunathan:
A Benders Approach to the Minimum Chordal Completion Problem. CPAIOR 2015: 47-64 - 2014
- [j4]David Bergman, John N. Hooker:
Graph coloring inequalities from all-different systems. Constraints An Int. J. 19(4): 404-433 (2014) - [j3]David Bergman, André A. Ciré, Willem Jan van Hoeve, Tallys H. Yunes:
BDD-based heuristics for binary optimization. J. Heuristics 20(2): 211-234 (2014) - [j2]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams. INFORMS J. Comput. 26(2): 253-268 (2014) - [j1]David Bergman, André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Sequence Constraints. J. Artif. Intell. Res. 50: 697-722 (2014) - [c5]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams - (Extended Abstract). CP 2014: 903-907 - [c4]David Bergman, André A. Ciré, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat, Willem Jan van Hoeve:
Parallel Combinatorial Optimization with Decision Diagrams. CPAIOR 2014: 351-367 - 2012
- [c3]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. CPAIOR 2012: 34-49 - [c2]David Bergman, John N. Hooker:
Graph Coloring Facets from All-Different Systems. CPAIOR 2012: 50-65 - 2011
- [c1]David Bergman, Willem Jan van Hoeve, John N. Hooker:
Manipulating MDD Relaxations for Combinatorial Optimization. CPAIOR 2011: 20-35
Coauthor Index
aka: Carlos Henrique Cardonha
aka: André A. Ciré
aka: Willem-Jan van Hoeve
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
