Остановите войну!
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 247 matches
- 2024
- Jeffrey Larson, Matt Menickelly:
Structure-aware methods for expensive derivative-free nonsmooth composite optimization. Math. Program. Comput. 16(1): 1-36 (2024) - Ayse N. Arslan, Jérémy Omer, Fulin Yan:
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price. Math. Program. Comput. 16(1): 151-184 (2024) - Mehdi Karimi, Levent Tunçel:
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form. Math. Program. Comput. 16(1): 37-92 (2024) - Michael Malmros Sørensen, Adam N. Letchford:
CP-Lib: Benchmark Instances of the Clique Partitioning Problem. Math. Program. Comput. 16(1): 93-111 (2024) - Tianyun Tang, Kim-Chuan Toh:
Self-adaptive ADMM for semi-strongly convex problems. Math. Program. Comput. 16(1): 113-150 (2024) - 2023
- Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. 15(3): 549-580 (2023) - Saverio Basso, Alberto Ceselli:
A data driven Dantzig-Wolfe decomposition framework. Math. Program. Comput. 15(1): 153-194 (2023) - Yasmine Beck, Ivana Ljubic, Martin Schmidt:
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. Math. Program. Comput. 15(4): 733-782 (2023) - Ksenia Bestuzheva, Ambros M. Gleixner, Stefan Vigerske:
A computational study of perspective cuts. Math. Program. Comput. 15(4): 703-731 (2023) - Raghu Bollapragada, Stefan M. Wild:
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization. Math. Program. Comput. 15(2): 327-364 (2023) - Nathaniel Bowman, Michael T. Heath:
Computing minimum-volume enclosing ellipsoids. Math. Program. Comput. 15(4): 621-650 (2023) - Christina Büsing, Timo Gersing, Arie M. C. A. Koster:
A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. 15(2): 269-326 (2023) - Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Performance enhancements for a generic conic interior point algorithm. Math. Program. Comput. 15(1): 53-101 (2023) - Christian Kanzow, Daniel Steck:
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization. Math. Program. Comput. 15(3): 417-444 (2023) - Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, Jean-Paul Watson, David L. Woodruff:
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty. Math. Program. Comput. 15(4): 591-619 (2023) - Matteo Lapucci, Pierluigi Mansueto, Fabio Schoen:
A memetic procedure for global multi-objective optimization. Math. Program. Comput. 15(2): 227-267 (2023) - Miles Lubin, Oscar Dowson, Joaquim Dias Garcia, Joey Huchette, Benoît Legat, Juan Pablo Vielma:
JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. 15(3): 581-589 (2023) - Bjørnar Luteberget, Giorgio Sartor:
Feasibility Jump: an LP-free Lagrangian MIP heuristic. Math. Program. Comput. 15(2): 365-388 (2023) - Stephen J. Maher, Elina Rönnberg:
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems. Math. Program. Comput. 15(3): 509-548 (2023) - Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
A hierarchy of spectral relaxations for polynomial optimization. Math. Program. Comput. 15(4): 651-701 (2023) - Demetrios V. Papazaharias, Jose L. Walteros:
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations. Math. Program. Comput. 15(1): 103-151 (2023) - Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. Math. Program. Comput. 15(3): 445-470 (2023) - Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs:
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds. Math. Program. Comput. 15(1): 1-51 (2023) - Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella:
On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Math. Program. Comput. 15(2): 389-416 (2023) - Yangyang Xu, Yibo Xu, Yonggui Yan, Colin Sutcher-Shepard, Leopold Grinberg, Jie Chen:
Parallel and distributed asynchronous adaptive stochastic gradient methods. Math. Program. Comput. 15(3): 471-508 (2023) - Zhensheng Yu, Xuyu Chen, Xudong Li:
A dynamic programming approach for generalized nearly isotonic optimization. Math. Program. Comput. 15(1): 195-225 (2023) - 2022
- Akshay Agrawal, Stephen P. Boyd, Deepak Narayanan, Fiodar Kazhamiaka, Matei Zaharia:
Allocation of fungible resources via a fast, scalable price discovery method. Math. Program. Comput. 14(3): 593-622 (2022) - Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Leonardo D. Secchin, Paulo J. S. Silva:
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees. Math. Program. Comput. 14(1): 121-146 (2022) - Ignacio Aravena, Anthony Papavasiliou:
Correction to: Asynchronous Lagrangian scenario decomposition. Math. Program. Comput. 14(2): 415-416 (2022) - Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol:
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem. Math. Program. Comput. 14(4): 673-697 (2022)
skipping 217 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-05-23 04:06 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