![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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,878 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) - 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) - 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) - 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) - Pietro D'Alessandro, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
The Descent-Ascent Algorithm for DC Programming. INFORMS J. Comput. 36(2): 657-671 (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) - Nicolas Forget, Sophie N. Parragh:
Enhancing Branch-and-Bound for Multiobjective 0-1 Programming. INFORMS J. Comput. 36(1): 285-304 (2024) - Joaquim Dias Garcia, Guilherme Bodin, Alexandre Street:
<tt>BilevelJuMP.jl: </tt> Modeling and Solving Bilevel Optimization Problems in Julia. INFORMS J. Comput. 36(2): 327-335 (2024) - Yeu-Shiang Huang, Chih-Chiang Fang, Chun-Hsuan Chou, Tzu-Liang (Bill) Tseng:
A Study on Optimal Release Schedule for Multiversion Software. INFORMS J. Comput. 36(1): 121-140 (2024) - Richard Krug, Günter Leugering, Alexander Martin, Martin Schmidt, Dieter Weninger:
A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems. INFORMS J. Comput. 36(2): 397-416 (2024) - Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. INFORMS J. Comput. 36(1): 203-223 (2024) - Henri Lefebvre, Enrico Malaguti, Michele Monaci:
Adjustable Robust Optimization with Discrete Uncertainty. INFORMS J. Comput. 36(1): 78-96 (2024) - Markus Leitner, Andrea Lodi, Roberto Roberti, Claudio Sole:
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. INFORMS J. Comput. 36(2): 479-494 (2024) - Tianyi Li, Munther A. Dahleh:
Automation of Strategic Data Prioritization in System Model Calibration: Sensor Placement. INFORMS J. Comput. 36(1): 163-184 (2024) - Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao:
D-Optimal Data Fusion: Exact and Approximation Algorithms. INFORMS J. Comput. 36(1): 97-120 (2024) - Yajuan Li, Zachary T. Kaplan, Marvin K. Nakayama:
Monte Carlo Methods for Economic Capital. INFORMS J. Comput. 36(1): 266-284 (2024) - Carla Michini, Peter Ohmann, Ben Liblit, Jeff T. Linderoth:
A Set-Covering Approach to Customized Coverage Instrumentation. INFORMS J. Comput. 36(1): 21-38 (2024) - Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra, Shingo Kobori:
Seamless Multimodal Transportation Scheduling. INFORMS J. Comput. 36(2): 336-358 (2024) - Lennart Sinjorgo, Renata Sotirov:
On Solving MAX-SAT Using Sum of Squares. INFORMS J. Comput. 36(2): 417-433 (2024) - Alice E. Smith:
Note from the Editor. INFORMS J. Comput. 36(1): 1-2 (2024)
skipping 1,848 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-03 13:05 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