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 131 matches
- 2024
- Manolis N. Kritikos, George Ioannou:
Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs. Int. J. Prod. Res. 62(1-2): 574-585 (2024) - Behrooz Ghasemishabankareh, Xiaodong Li, Melih Ozlen:
User-Preference Based Evolutionary Algorithms for Solving Multi-Objective Nonlinear Minimum Cost Flow Problems. GECCO 2024 - 2023
- Somayeh Khezri, Salman Khodayifar:
Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory. Comput. Oper. Res. 156: 106260 (2023) - Mehdi Ansari, Juan Sebastian Borrero, Leonardo Lozano:
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions. INFORMS J. Comput. 35(1): 83-103 (2023) - Oliverio Cruz-Mejia, Adam N. Letchford:
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82(2): 167-176 (2023) - Can Gokalp, Stephen D. Boyles, Avinash Unnikrishnan:
Mean-standard deviation model for minimum cost flow problem. Networks 81(3): 378-398 (2023) - Himan Abdollahpouri, Zahra Nazari, Alex Gain, Clay Gibson, Maria Dimakopoulou, Jesse Anderton, Benjamin A. Carterette, Mounia Lalmas, Tony Jebara:
Calibrated Recommendations as a Minimum-Cost Flow Problem. WSDM 2023: 571-579 - 2022
- Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust minimum cost flow problem under consistent flow constraints. Ann. Oper. Res. 312(2): 691-722 (2022) - Gökçehan Kara, Can C. Özturan:
Parallel network simplex algorithm for the minimum cost flow problem. Concurr. Comput. Pract. Exp. 34(4) (2022) - David Könen, Daniel R. Schmidt, Christiane Spisla:
Finding all minimum cost flows and a faster algorithm for the K best flow problem. Discret. Appl. Math. 321: 333-349 (2022) - Philipp Herrmann, Anna Meyer, Stefan Ruzika, Luca E. Schäfer, Fabian von der Warth:
A machine learning based algorithm selection method to solve the minimum cost flow problem. CoRR abs/2210.02195 (2022) - 2021
- Zeynep Suvak, I. Kuban Altinel, Necati Aras:
Minimum cost flow problem with conflicts. Networks 78(4): 421-442 (2021) - Salman Khodayifar:
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. Optim. Lett. 15(3): 1009-1026 (2021) - David Könen, Daniel R. Schmidt, Christiane Spisla:
Finding all minimum cost flows and a faster algorithm for the K best flow problem. CoRR abs/2105.10225 (2021) - 2020
- Behrooz Ghasemishabankareh, Xiaodong Li, Melih Ozlen, Frank Neumann:
Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions. Appl. Soft Comput. 86 (2020) - Marko Spoljarec, Robert Manger:
Heuristic solutions to robust variants of the minimum-cost integer flow problem. J. Heuristics 26(4): 531-559 (2020) - Behrooz Ghasemishabankareh, Melih Ozlen, Xiaodong Li, Kalyanmoy Deb:
A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems. Soft Comput. 24(2): 1153-1169 (2020) - Jincheng Jiang, Jinsong Chen, Chisheng Wang:
Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems. J. Supercomput. 76(12): 9800-9826 (2020) - Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz:
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints. CoRR abs/2008.02035 (2020) - 2019
- André B. Chassein, Anika Kinscherff:
Complexity of strict robust integer minimum cost flow problems: An overview and further results. Comput. Oper. Res. 104: 228-238 (2019) - I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019) - Shuvomoy Das Gupta, Lacra Pavel:
On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems. J. Glob. Optim. 74(3): 523-548 (2019) - Sevnaz Nourollahi, Archis Ghate:
Inverse optimization in minimum cost flow problems on countably infinite networks. Networks 73(3): 292-305 (2019) - Behrooz Ghasemishabankareh, Melih Ozlen, Xiaodong Li:
NSGA-II for Solving Multiobjective Integer Minimum Cost Flow Problem with Probabilistic Tree-Based Representation. EMO 2019: 541-552 - Marko Spoljarec, Robert Manger:
Heuristic solutions to robust variants of the minimum-cost integer flow problem. CoRR abs/1907.09468 (2019) - 2018
- Soheila Abdi, Fahimeh Baroughi Bonab, Behrooz Alizadeh:
The Minimum Cost Flow Problem of Uncertain Random Network. Asia Pac. J. Oper. Res. 35(3): 1850016:1-1850016:18 (2018) - Behrooz Ghasemishabankareh, Melih Ozlen, Frank Neumann, Xiaodong Li:
A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems. PPSN (1) 2018: 69-81 - Doris Benda, Xiaoli Chu, Sumei Sun, Tony Q. S. Quek, Alastair Buckley:
Modeling and Optimization of Renewable-Energy Sharing among Base Stations as a Minimum-Cost-Maximum-Flow Problem. VTC Spring 2018: 1-5 - 2017
- Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
A network simplex method for the budget-constrained minimum cost flow problem. Eur. J. Oper. Res. 259(3): 864-872 (2017) - Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome:
The budgeted minimum cost flow problem with unit upgrading cost. Networks 69(1): 67-82 (2017)
skipping 101 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-09-21 20:18 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