
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 year
- no options
- temporarily not available
Publication search results
found 327 matches
- 2021
- Salman Khodayifar:
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. Optim. Lett. 15(3): 1009-1026 (2021) - Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy:
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem. CoRR abs/2101.03707 (2021) - 2020
- Anna Melchiori, Antonino Sgalambro
:
A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem. Eur. J. Oper. Res. 282(3): 846-857 (2020) - Urmila Pyakurel, Shiva Prakash Gupta, Durga Prasad Khanal, Tanka Nath Dhamala:
Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals. Int. J. Math. Math. Sci. 2020: 2676378:1-2676378:13 (2020) - Tatsushi Nishi
, Shuhei Akiyama, Toshimitsu Higashi
, Kenji Kumagai
:
Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow. IEEE Trans Autom. Sci. Eng. 17(2): 966-980 (2020) - Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. ISAAC 2020: 41:1-41:11 - Coulter Beeson, Bruce Shepherd:
The Empirical Core of the Multicommodity Flow Game Without Side Payments. CoRR abs/2001.09911 (2020) - Anya Chaturvedi, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks. CoRR abs/2005.04533 (2020) - Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. CoRR abs/2007.01280 (2020) - Richard S. Barr, Thomas McLoud:
The Invisible Hand Heuristic for Origin-Destination Integer Multicommodity Network Flows. CoRR abs/2007.06693 (2020) - 2019
- Hela Masri, Saoussen Krichen
, Adel Guitouni:
Metaheuristics for solving the biobjective single-path multicommodity communication flow problem. Int. Trans. Oper. Res. 26(2): 589-614 (2019) - Iara Ciurria-Infosino, Daniel Granot, Frieda Granot
:
Monotonicity and conformality in multicommodity network-flow problems. Networks 74(3): 302-319 (2019) - Artur Tomaszewski, Michal Pióro, Davide Sanvito, Ilario Filippini, Antonio Capone:
On Optimization of Semi-stable Routing in Multicommodity Flow Networks. INOC 2019: 54-59 - 2018
- Hela Masri, Saoussen Krichen
:
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem. Ann. Oper. Res. 267(1-2): 353-377 (2018) - Anna Melchiori, Antonino Sgalambro
:
A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem. Comput. Oper. Res. 92: 111-129 (2018) - Enrico Grande, Gaia Nicosia
, Andrea Pacifici, Vincenzo Roselli:
An exact algorithm for a multicommodity min-cost flow over time problem. Electron. Notes Discret. Math. 64: 125-134 (2018) - Murat Oguz, Tolga Bektas
, Julia A. Bennell:
Multicommodity flows and Benders decomposition for restricted continuous location problems. Eur. J. Oper. Res. 266(3): 851-863 (2018) - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. 47(4): 1483-1504 (2018) - Xiaotao Jia
, Yici Cai, Qiang Zhou, Bei Yu
:
A Multicommodity Flow-Based Detailed Router With Efficient Acceleration Techniques. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1): 217-230 (2018) - Ahmed Salah, Heba M. Abdel-Atty, Rawya Rizk
:
Joint Channel Assignment and Power Allocation Based on Maximum Concurrent Multicommodity Flow in Cognitive Radio Networks. Wirel. Commun. Mob. Comput. 2018: 3545946:1-3545946:14 (2018) - Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. SEA 2018: 25:1-25:14 - 2017
- Naoto Katayama:
A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem. Asia Pac. J. Oper. Res. 34(6): 1750033:1-1750033:24 (2017) - Lluís-Miquel Munguía, Shabbir Ahmed
, David A. Bader
, George L. Nemhauser, Vikas Goel, Yufen Shao:
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. Comput. Oper. Res. 77: 44-57 (2017) - Árton P. Dorneles, Olinto César Bassi de Araújo, Luciana S. Buriol:
A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur. J. Oper. Res. 256(3): 685-695 (2017) - Bernard Fortz
, Luis Eduardo Neves Gouveia
, Martim Joyce-Moniz:
Models for the piecewise linear unsplittable multicommodity flow problems. Eur. J. Oper. Res. 261(1): 30-42 (2017) - Shmuel Onn:
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory. J. Comput. Syst. Sci. 83(1): 207-214 (2017) - Pengfei Zhang, Neng Fan:
Analysis of budget for interdiction on multicommodity network flows. J. Glob. Optim. 67(3): 495-525 (2017) - Colin McDiarmid, Alex Scott, Paul Withers:
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50(3): 437-463 (2017) - Sibo Ding:
Uncertain minimum cost multicommodity flow problem. Soft Comput. 21(1): 223-231 (2017) - Pawel Bialon:
A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees. Telecommun. Syst. 64(3): 525-542 (2017)
skipping 297 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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
retrieved on 2021-04-11 13:00 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