default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 702 matches
- 2024
- Elahe Amiri
, Antoine Legrain, Issmail El Hallaoui:
Online Optimization of a Dial-a-Ride Problem with the Integral Primal Simplex. CPAIOR (1) 2024: 1-16 - Mathis Azéma, Guy Desaulniers, Jorge E. Mendoza, Gilles Pesant:
A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints. CPAIOR (1) 2024: 17-33 - Hugo Barral, Mohamed Gaha, Amira Dems, Alain Côté, Franklin Nguewouo, Quentin Cappart:
Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem. CPAIOR (1) 2024: 34-50 - Djawad Bekkoucha, Abdelkader Ouali, Patrice Boizumault, Bruno Crémilleux:
Efficiently Mining Closed Interval Patterns with Constraint Programming. CPAIOR (1) 2024: 51-67 - Frédéric Berthiaume, Claude-Guy Quimper:
Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue Constraint. CPAIOR (1) 2024: 68-83 - Hendrik Bierlee, Jip J. Dekker, Vitaly Lagoon, Peter J. Stuckey, Guido Tack:
Single Constant Multiplication for SAT. CPAIOR (1) 2024: 84-98 - Léo Boisvert, Hélène Verhaeghe, Quentin Cappart:
Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches. CPAIOR (1) 2024: 99-108 - Robin A. Brown, Davide Venturelli, Marco Pavone, David E. Bernal Neira:
Accelerating Continuous Variable Coherent Ising Machines via Momentum. CPAIOR (1) 2024: 109-126 - Víctor Bucarey, Sophia Calderón, Gonzalo Muñoz, Frédéric Semet:
Decision-Focused Predictions via Pessimistic Bilevel Optimization: A Computational Study. CPAIOR (1) 2024: 127-135 - Samuel Buchet, David Allouche, Simon de Givry, Thomas Schiex:
Bi-objective Discrete Graphical Model Optimization. CPAIOR (1) 2024: 136-152 - Auguste Burlats, Pierre Schaus, Cristel Pelsser:
An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis. CPAIOR (1) 2024: 153-169 - Chris Cameron, Jason S. Hartford, Taylor Lundy, Tuan Truong, Alan Milligan, Rex Chen, Kevin Leyton-Brown:
UNSAT Solver Synthesis via Monte Carlo Forest Search. CPAIOR (1) 2024: 170-189 - Mariane R. Sponchiado Cassenote, Guilherme Alex Derenievicz, Fabiano Silva:
A Hybrid Approach Integrating Generalized Arc Consistency and Differential Evolution for Global Optimization. CPAIOR (1) 2024: 190-207 - Violet Xinying Chen, John N. Hooker, Derek Leben:
Assessing Group Fairness with Social Welfare Optimization. CPAIOR (1) 2024: 208-225 - Vianney Coppé, Xavier Gillard, Pierre Schaus:
Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams. CPAIOR (1) 2024: 226-242 - Toby O. Davies, Frédéric Didier, Laurent Perron:
ViolationLS: Constraint-Based Local Search in CP-SAT. CPAIOR (1) 2024: 243-258 - Ricardo Euler, Ralf Borndörfer, Christian Puchert, Tuomo Takkula:
ULD Build-Up Scheduling with Logic-Based Benders Decomposition. CPAIOR (1) 2024: 259-276 - Vera Fischer, Antoine Legrain, David Schindl:
A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities. CPAIOR (1) 2024: 277-292 - Alexandre Forel, Axel Parmentier, Thibaut Vidal:
Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles. CPAIOR (1) 2024: 293-309 - Alexander Hoen, Andy Oertel, Ambros M. Gleixner, Jakob Nordström:
Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs. CPAIOR (1) 2024: 310-328 - Kim van den Houten, David M. J. Tax, Esteban Freydell, Mathijs de Weerdt:
Learning from Scenarios for Repairable Stochastic Scheduling. CPAIOR (2) 2024: 234-242 - Guillaume Infantes, Stéphanie Roussel, Pierre Pereira, Antoine Jacquet, Emmanuel Benazera:
Learning to Solve Job Shop Scheduling Under Uncertainty. CPAIOR (1) 2024: 329-345 - Christoph Jabs, Jeremias Berg, Matti Järvisalo:
Core Boosting in SAT-Based Multi-objective Optimization. CPAIOR (2) 2024: 1-19 - Connor Lawless, Oktay Günlük:
Fair Minimum Representation Clustering. CPAIOR (2) 2024: 20-37 - Matthew J. McIlree, Ciaran McCreesh, Jakob Nordström:
Proof Logging for the Circuit Constraint. CPAIOR (2) 2024: 38-55 - Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic:
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. CPAIOR (2) 2024: 56-73 - Mohsen Nafar, Michael Römer:
Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization. CPAIOR (2) 2024: 74-82 - Rahul Patel, Elias B. Khalil:
LEO: Learning Efficient Orderings for Multiobjective Binary Decision Diagrams. CPAIOR (2) 2024: 83-110 - Felipe de Carvalho Pereira, Pedro J. de Rezende, Tallys H. Yunes:
Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches. CPAIOR (2) 2024: 111-127 - Egon Persak, Miguel F. Anjos:
Learning Deterministic Surrogates for Robust Convex QCQPs. CPAIOR (2) 2024: 128-140
skipping 672 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-12-23 00:10 CET from data curated 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:
