Остановите войну!
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 181 matches
- 2023
- Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba:
A local search approximation algorithm for the multiway cut problem. Discret. Appl. Math. 338: 8-21 (2023) - Ashenafi Awraris, Berhanu Guta Wordofa, Semu Mitiku Kassa:
Branch-and-cut solution approach for multilevel mixed integer linear programming problems. EURO J. Comput. Optim. 11: 100076 (2023) - Eduardo M. Silva, Gislaine Mara Melega, Kerem Akartunali, Silvio A. de Araujo:
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost. Eur. J. Oper. Res. 304(2): 443-460 (2023) - Ernesto G. Birgin, Oberlan Christo Romão, Débora P. Ronconi:
A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers. Expert Syst. Appl. 223: 119866 (2023) - Caroline de Arruda Signorini, Silvio Alexandre de Araujo, Sônia Cristina Poltroniere, Gislaine Mara Melega:
One-dimensional multi-period cutting stock problem with two stages applied to lattice slab production. J. Oper. Res. Soc. 74(5): 1378-1392 (2023) - Heloisa Vasques da Silva, Felipe Kesrouani Lemos, Adriana Cristina Cherri, Silvio Alexandre de Araujo:
Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes. RAIRO Oper. Res. 57(1): 183-200 (2023) - Yu Yang:
An Exact Price-Cut-and-Enumerate Method for the Capacitated Multitrip Vehicle Routing Problem with Time Windows. Transp. Sci. 57(1): 230-251 (2023) - Jiachen Zhang, Youcef Magnouche, Sébastien Martin, Antoine Fressancourt, J. Christopher Beck:
The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm. CoDIT 2023: 477-482 - Rakesh Kumar Bajaj, Saurabh Srivastava, Abhishek Guleria:
Solving Multi-objective Linear Fractional Programming Problem Utilizing (α , β )-Cut in Triangular Intuitionistic Fuzzy Setup. Real Life Applications of Multiple Criteria Decision Making Techniques in Fuzzy Domain 2023: 351-368 - 2022
- Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Alberto Urrutia:
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Eur. J. Oper. Res. 300(1): 207-220 (2022) - Qiang Luo, Bing Du, Yunqing Rao, Xiaoqiang Guo:
Metaheuristic algorithms for a special cutting stock problem with multiple stocks in the transformer manufacturing industry. Expert Syst. Appl. 210: 118578 (2022) - Caroline de Arruda Signorini, Silvio Alexandre de Araujo, Gislaine Mara Melega:
One-dimensional multi-period cutting stock problems in the concrete industry. Int. J. Prod. Res. 60(8): 2386-2403 (2022) - Raquel Bernardino, Luís Gouveia, Ana Paias, Daniel Santos:
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. Networks 80(4): 502-571 (2022) - Hanxiao Zhang, Mu-Xia Sun, Yan-Fu Li:
Reliability-redundancy allocation problem in multi-state flow network: Minimal cut-based approximation scheme. Reliab. Eng. Syst. Saf. 225: 108564 (2022) - Magnus Wahlström:
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms 18(2): 15:1-15:19 (2022) - Oscar Saldías, Carla Guerrero, Rodrigo Olivares, Daniel Morillo-Torres, Gustavo Gatica:
A Strategic-Operational Contribution to the One-Dimensional Multi-period Cutting Stock Problem for Sawmills. ARTIIS (2) 2022: 30-41 - 2021
- Franco Quezada:
Cutting planes generation and decomposition-based approaches for solving multi-stage stochastic lot-sizing problems. (Génération de coupes et approches basées sur la décomposition pour résoudre des problèmes de dimensionnement de lots stochastiques à plusieurs étapes). Sorbonne University, Paris, France, 2021 - Sergio Cavero, Eduardo G. Pardo, Manuel Laguna, Abraham Duarte:
Multistart search for the Cyclic Cutwidth Minimization Problem. Comput. Oper. Res. 126: 105116 (2021) - Nicola Bianchessi, Stefan Irnich, Christian Tilk:
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288: 152-170 (2021) - Ramin Javadi, Saleh Ashkboos:
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. Discret. Appl. Math. 289: 281-291 (2021) - Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. Discret. Appl. Math. 290: 86-111 (2021) - Washington A. Oliveira, Diego Jacinto Fiorotto, Xiang Song, Dylan F. Jones:
An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem. Eur. J. Oper. Res. 295(3): 996-1007 (2021) - Ning Xue, Ruibin Bai, Rong Qu, Uwe Aickelin:
A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem. Eur. J. Oper. Res. 292(2): 500-514 (2021) - Felipe Kesrouani Lemos, Adriana Cristina Cherri, Silvio Alexandre de Araujo:
The cutting stock problem with multiple manufacturing modes applied to a construction industry. Int. J. Prod. Res. 59(4): 1088-1106 (2021) - Michiel A. J. uit het Broek, Albert H. Schrotenboer, Bolor Jargalsaikhan, Kees Jan Roodbergen, Leandro C. Coelho:
Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm. Oper. Res. 69(2): 380-409 (2021) - Xue-Cheng Tai, Liang-Jian Deng, Ke Yin:
A Multigrid Algorithm for Maxflow and Min-Cut Problems with Applications to Multiphase Image Segmentation. J. Sci. Comput. 87(3): 101 (2021) - Niv Buchbinder, Roy Schwartz, Baruch Weizman:
Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. 46(2): 757-771 (2021) - Paula Fermín Cueto, Ivona Gjeroska, Albert Solà Vilalta, Miguel F. Anjos:
A solution approach for multi-trip vehicle routing problems with time windows, fleet sizing, and depot location. Networks 78(4): 503-522 (2021) - Alberto Ceselli, Ángel Felipe, M. Teresa Ortuño, Giovanni Righini, Gregorio Tirado:
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies. Oper. Res. Forum 2(1) (2021) - Adejuyigbe O. Fajemisin, Laura Climent, Steven D. Prestwich:
An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem. OR Spectr. 43(3): 665-692 (2021)
skipping 151 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-04-25 19:17 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