Остановите войну!
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 27 matches
- 2013
- Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey:
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4): 297-314 (2013) - Frédéric Babonneau, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou:
Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4): 255-272 (2013) - Vic Baston, Kensaku Kikuta:
Search games on networks with travelling and search costs and with arbitrary searcher starting points. Networks 62(1): 72-79 (2013) - Maurizio Boccia, Carlo Mannino, Igor Vasilyev:
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62(4): 315-326 (2013) - Merve Bodur, Tínaz Ekim, Z. Caner Taskin:
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62(4): 273-287 (2013) - Dirk Briskorn, Florian Jaehn:
A note on "Multistage Methods for Freight Train Classification". Networks 62(1): 80-81 (2013) - Qingqiong Cai, Xueliang Li, Jiangli Song:
Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. Networks 62(3): 220-224 (2013) - Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman:
Theoretical and computational advances for network diversion. Networks 62(3): 225-242 (2013) - Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols:
Optimal edge-coloring with edge rate constraints. Networks 62(3): 165-182 (2013) - Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci:
Distance edge coloring and collision-free communication in wireless sensor networks. Networks 62(1): 35-47 (2013) - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid". Networks 62(2): 161-163 (2013) - A. H. Hunter, Nicholas Pippenger:
Local versus global search in channel graphs. Networks 62(1): 27-34 (2013) - Lars Magnus Hvattum, Inge Norstad, Kjetil Fagerholt, Gilbert Laporte:
Analysis of an exact algorithm for the vessel speed optimization problem. Networks 62(2): 132-135 (2013) - Lasse Kliemann:
The price of anarchy in nonatomic consumption-relevance congestion games. Networks 62(2): 83-94 (2013) - Sebastian Kluge, Konrad Reif, Martin Brokate:
Computation of the optimal value function in time-dependent networks. Networks 62(2): 105-124 (2013) - Chungmok Lee, Kyungsik Lee, Sungsoo Park:
Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1): 1-16 (2013) - Miguel A. Lejeune, Srinivas Y. Prasad:
Effectiveness-equity models for facility location problems on tree networks. Networks 62(4): 243-254 (2013) - Asaf Levin, Uri Yovel:
Nonoblivious 2-Opt heuristics for the traveling salesman problem. Networks 62(3): 201-219 (2013) - Sara Mattia:
A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1): 17-26 (2013) - Dritan Nace, Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz:
Complexity of a classical flow restoration problem. Networks 62(2): 149-160 (2013) - Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient algorithms for a simple network design problem. Networks 62(2): 95-104 (2013) - James B. Orlin, Balachandran Vaidyanathan:
Fast algorithms for convex cost flow problems on circles, lines, and trees. Networks 62(4): 288-296 (2013) - Luigi Di Puglia Pugliese, Francesca Guerriero:
A survey of resource constrained shortest path problems: Exact solution approaches. Networks 62(3): 183-200 (2013) - Minghe Sun:
A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems. Networks 62(1): 56-71 (2013) - Clemens Thielen, Stephan Westphal:
Complexity and approximability of the maximum flow problem with minimum quantities. Networks 62(2): 125-131 (2013) - Balachandran Vaidyanathan:
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs. Networks 62(2): 136-148 (2013) - D. Jacob Wildstrom:
Parametrized relocation of low-mobility resources. Networks 62(1): 48-55 (2013)
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-28 12:02 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