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 1,936 matches
- 2024
- Shaojie Tang, Jing Yuan:
Group Equality in Adaptive Submodular Maximization. INFORMS J. Comput. 36(2): 359-376 (2024) - Lindong Liu, Xiangtong Qi, Zhou Xu:
Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach. INFORMS J. Comput. 36(2): 635-656 (2024) - Hao Lin, Guannan Liu, Junjie Wu, J. Leon Zhao:
Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series. INFORMS J. Comput. 36(2): 571-586 (2024) - Alireza Aghasi, Arun Rai, Yusen Xia:
A Deep Learning and Image Processing Pipeline for Object Characterization in Firm Operations. INFORMS J. Comput. 36(2): 616-634 (2024) - Izuwa Ahanor, Hugh R. Medal, Andrew C. Trapp:
DiversiTree: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems. INFORMS J. Comput. 36(1): 61-77 (2024) - Temitayo Ajayi, Seyedmohammadhossein Hosseinian, Andrew J. Schaefer, Clifton D. Fuller:
Combination Chemotherapy Optimization with Discrete Dosing. INFORMS J. Comput. 36(2): 434-455 (2024) - Zacharie Alès, Céline Engelbeen, Rosa Figueiredo:
Correlation Clustering Problem Under Mediation. INFORMS J. Comput. 36(2): 672-689 (2024) - Christian Artigues, Emmanuel Hébrard, Alain Quilliot, Hélène Toussaint:
The Continuous Time-Resource Trade-off Scheduling Problem with Time Windows. INFORMS J. Comput. 36(6): 1676-1695 (2024) - Roberto Baldacci, Stefano Coniglio, Jean-François Cordeau, Fabio Furini:
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36(1): 141-162 (2024) - Marleen Balvert:
Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets. INFORMS J. Comput. 36(3): 723-741 (2024) - Ankit Bansal, Jean-Philippe P. Richard, Bjorn P. Berg, Yu-Li Huang:
A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling. INFORMS J. Comput. 36(3): 918-937 (2024) - Opher Baron, Dmitry Krass, Arik Senderovich, Eliran Sherzer:
Supervised ML for Solving the GI/GI/1 Queue. INFORMS J. Comput. 36(3): 766-786 (2024) - Mahdis Bayani, Borzou Rostami, Yossiri Adulyasak, Louis-Martin Rousseau:
A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization. INFORMS J. Comput. 36(6): 1501-1521 (2024) - Mehdi Behroozi:
Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities. INFORMS J. Comput. 36(3): 787-819 (2024) - Russell Bent, Byron Tasseff, Carleton Coffrin:
InfrastructureModels: Composable Multi-infrastructure Optimization in Julia. INFORMS J. Comput. 36(2): 600-615 (2024) - Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat, Akshay Sharma:
Flexible Differentiable Optimization via Model Transformations. INFORMS J. Comput. 36(2): 456-478 (2024) - Nicola Bianchessi, Timo Gschwind, Stefan Irnich:
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36(1): 224-244 (2024) - Marcos Blufstein, Gonzalo Lera-Romero, Francisco J. Soulignac:
Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone. INFORMS J. Comput. 36(4): 1064-1083 (2024) - Stefan Bock, Nils Boysen:
Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses. INFORMS J. Comput. 36(1): 3-20 (2024) - Yiyin Cao, Yin Chen, Chuangyin Dang:
A Differentiable Path-Following Method with a Compact Formulation to Compute Proper Equilibria. INFORMS J. Comput. 36(2): 377-396 (2024) - Diego Cattaruzza, Martine Labbé, Matteo Petris, Marius Roland, Martin Schmidt:
Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems. INFORMS J. Comput. 36(4): 1084-1107 (2024) - Vianney Coppé, Xavier Gillard, Pierre Schaus:
Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection. INFORMS J. Comput. 36(6): 1522-1542 (2024) - Pietro D'Alessandro, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
The Descent-Ascent Algorithm for DC Programming. INFORMS J. Comput. 36(2): 657-671 (2024) - Yongzheng Dai, Chen Chen:
Sparsity-Exploiting Distributed Projections onto a Simplex. INFORMS J. Comput. 36(3): 820-835 (2024) - Amin Dehghanian, Yujia Xie, Nicoleta Serban:
Identifying Socially Optimal Equilibria Using Combinatorial Properties of Nash Equilibria in Bimatrix Games. INFORMS J. Comput. 36(5): 1261-1286 (2024) - Jasper van Doornmalen, Christopher Hojny:
Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs. INFORMS J. Comput. 36(3): 868-883 (2024) - Hongmin W. Du, Yingfan L. Du, Zhao Zhang:
Adaptive Influence Maximization: Adaptability via Nonadaptability. INFORMS J. Comput. 36(5): 1190-1200 (2024) - Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. INFORMS J. Comput. 36(4): 956-965 (2024) - Adolfo R. Escobedo:
Exact Matrix Factorization Updates for Nonlinear Programming. INFORMS J. Comput. 36(1): 245-265 (2024) - Xiangyi Fan, Grani A. Hanasusanto:
A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse. INFORMS J. Comput. 36(2): 526-542 (2024)
skipping 1,906 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 2025-01-18 16:28 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