Остановите войну!
for scientists:
default search action
Search 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 33 matches
- 2023
- Yiwei Bai, Qinru Shi, Marc Grimson, Alexander Flecker, Carla P. Gomes:
Efficiently Approximating High-Dimensional Pareto Frontiers for Tree-Structured Networks Using Expansion and Compression. CPAIOR 2023: 1-17 - Auguste Burlats, Gilles Pesant:
Exploiting Entropy in Constraint Programming. CPAIOR 2023: 320-335 - Junyang Cai, Khai-Nguyen Nguyen, Nishant Shrestha, Aidan Good, Ruisen Tu, Xin Yu, Shandian Zhe, Thiago Serra:
Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions. CPAIOR 2023: 200-218 - Aravinth Chembu, Scott Sanner, Elias B. Khalil:
Scalable and Near-Optimal ε-Tube Clusterwise Regression. CPAIOR 2023: 254-263 - Antonia Chmiela, Ambros M. Gleixner, Pawel Lichocki, Sebastian Pokutta:
Online Learning for Scheduling MIP Heuristics. CPAIOR 2023: 114-123 - Eldan Cohen:
Interpretable Clustering via Soft Clustering Trees. CPAIOR 2023: 281-298 - Parag Pravin Dakle, Serdar Kadioglu, Karthik Uppuluri, Regina Politi, Preethi Raghavan, SaiKrishna Rallabandi, Ravisutha Srinivasamurthy:
Ner4Opt: Named Entity Recognition for Optimization Modelling from Natural Language. CPAIOR 2023: 299-319 - Paulius Dilkas:
Generating Random Instances of Weighted Model Counting - An Empirical Analysis with Varying Primal Treewidth. CPAIOR 2023: 395-416 - Nikolaos Efthymiou, Neil Yorke-Smith:
Predicting the Optimal Period for Cyclic Hoist Scheduling Problems. CPAIOR 2023: 238-253 - Mostafa ElAraby, Guy Wolf, Margarida Carvalho:
OAMIP: Optimizing ANN Architectures Using Mixed-Integer Programming. CPAIOR 2023: 219-237 - Aaron M. Ferber, Emily Griffin, Bistra Dilkina, Burcu B. Keskin, Meredith Gore:
Predicting Wildlife Trafficking Routes with Differentiable Shortest Paths. CPAIOR 2023: 460-476 - Rebecca Gentzel, Laurent Michel, Willem-Jan van Hoeve:
Optimization Bounds from Decision Diagrams in Haddock. CPAIOR 2023: 150-166 - Ramiz Gindullin, Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Claude-Guy Quimper:
Boolean-Arithmetic Equations: Acquisition and Uses. CPAIOR 2023: 378-394 - Christopher Hojny, Marc E. Pfetsch:
Handling Symmetries in Mixed-Integer Semidefinite Programs. CPAIOR 2023: 69-78 - Xinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee:
Branch & Learn with Post-hoc Correction for Predict+Optimize with Unknown Parameters in Constraints. CPAIOR 2023: 264-280 - Taoan Huang, Aaron M. Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner:
Local Branching Relaxation Heuristics for Integer Linear Programs. CPAIOR 2023: 96-113 - Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - Avraham Itzhakov, Michael Codish:
Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. CPAIOR 2023: 133-149 - Jihwan Jeong, Scott Sanner, Akshat Kumar:
A Mixed-Integer Linear Programming Reduction of Disjoint Bilinear Programs via Symbolic Variable Elimination. CPAIOR 2023: 79-95 - Carla Juvin, Laurent Houssin, Pierre Lopez:
Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty. CPAIOR 2023: 354-369 - Anthony Karahalios, Willem-Jan van Hoeve:
Column Elimination for Capacitated Vehicle Routing Problems. CPAIOR 2023: 35-51 - Dongyun Kim, Yeonjun Choi, Kyungduk Moon, Myungho Lee, Kangbok Lee, Michael L. Pinedo:
Iterated Greedy Constraint Programming for Scheduling Steelmaking Continuous Casting. CPAIOR 2023: 477-492 - Anton Korikov, J. Christopher Beck:
Objective-Based Counterfactual Explanations for Linear Discrete Optimization. CPAIOR 2023: 18-34 - Pierre Montalbano, David Allouche, Simon de Givry, George Katsirelos, Tomás Werner:
Virtual Pairwise Consistency in Cost Function Networks. CPAIOR 2023: 417-426 - Egon Persak, Miguel F. Anjos:
Contextual Robust Optimisation with Uncertainty Quantification. CPAIOR 2023: 124-132 - Gauthier Pezzoli, Gilles Pesant:
A Weighted Counting Algorithm for the Circuit Constraint. CPAIOR 2023: 370-377 - Ítalo Santana, Andrea Lodi, Thibaut Vidal:
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill? CPAIOR 2023: 184-199 - Samuel Squillaci, Cédric Pralet, Stéphanie Roussel:
Scheduling Complex Observation Requests for a Constellation of Satellites: Large Neighborhood Search Approaches. CPAIOR 2023: 443-459 - Fabio Tardivo, Agostino Dovier, Andrea Formisano, Laurent Michel, Enrico Pontelli:
Constraint Propagation on GPU: A Case Study for the Cumulative Constraint. CPAIOR 2023: 336-353 - Trong-Hieu Tran, Cédric Pralet, Hélène Fargier:
Combining Incomplete Search and Clause Generation: An Application to the Orienteering Problems with Time Windows. CPAIOR 2023: 493-509
skipping 3 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-08-31 19:23 CEST 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