![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 38 matches
- 2018
- Nair Maria Maia de Abreu
, Lilian Markenzon:
Vulnerability of Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 64: 55-63 (2018) - Agostinho Agra
, Cristina Requejo
, Filipe Rodrigues
:
A hybrid heuristic for a stochastic production-inventory-routing problem. Electron. Notes Discret. Math. 64: 345-354 (2018) - Zacharie Alès, Thi Sang Nguyen, Michael Poss:
Minimizing the weighted sum of completion times under processing time uncertainty. Electron. Notes Discret. Math. 64: 15-24 (2018) - Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy:
Design of fiber cable tree FTTH networks. Electron. Notes Discret. Math. 64: 235-244 (2018) - Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn:
Bilevel Model for Adaptive Network Flow Problem. Electron. Notes Discret. Math. 64: 105-114 (2018) - Fabio Barbosa
, Amaro de Sousa, Agostinho Agra
:
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes. Electron. Notes Discret. Math. 64: 165-174 (2018) - Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. Electron. Notes Discret. Math. 64: 365-374 (2018) - Christina Büsing, Martin Comis
:
Budgeted Colored Matching Problems. Electron. Notes Discret. Math. 64: 245-254 (2018) - Mikael Capelle, Marie-José Huguet, Nicolas Jozefowiez, Xavier Olive:
Ground stations networks for Free-Space Optical communications: maximizing the data transfer. Electron. Notes Discret. Math. 64: 255-264 (2018) - Amadeu Almeida Coco
, Andréa Cynthia Santos
, Thiago F. Noronha:
Formulation and algorithms for the robust maximal covering location problem. Electron. Notes Discret. Math. 64: 145-154 (2018) - Paulo Roberto de Oliveira da Costa, Stefano Mauceri, Paula Carroll
, Fabiano Pallonetto
:
A Genetic Algorithm for a Green Vehicle Routing Problem. Electron. Notes Discret. Math. 64: 65-74 (2018) - David Coudert, James R. Luedtke, Eduardo Moreno
, Konstantinos Priftis:
Computing and maximizing the exact reliability of wireless backhaul networks. Electron. Notes Discret. Math. 64: 85-94 (2018) - Fabio D'Andreagiovanni
, Rosario Giuseppe Garroppo, Maria Grazia Scutellà:
Green Design of Wireless Local Area Networks by Multiband Robust Optimization. Electron. Notes Discret. Math. 64: 225-234 (2018) - Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub:
A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem. Electron. Notes Discret. Math. 64: 305-314 (2018) - Ibrahima Diarrassouba, Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub:
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut. Electron. Notes Discret. Math. 64: 315-324 (2018) - Julian Enoch, Brigitte Jaumard:
Towards Optimal and Scalable Solution for Routing and Spectrum Allocation. Electron. Notes Discret. Math. 64: 335-344 (2018) - Martina Fischetti
, David Pisinger
:
Mixed Integer Linear Programming for new trends in wind farm cable routing. Electron. Notes Discret. Math. 64: 115-124 (2018) - Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo N. Djidjev:
Global Optimization for Scaffolding and Completing Genome Assemblies. Electron. Notes Discret. Math. 64: 185-194 (2018) - Fabio Furini
, Enrico Malaguti, Sébastien Martin
, Ian-Christopher Ternier:
ILP Models and Column Generation for the Minimum Sum Coloring Problem. Electron. Notes Discret. Math. 64: 215-224 (2018) - Luís Gouveia, Pedro Moura:
Preface. Electron. Notes Discret. Math. 64: 1-3 (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) - Yipeng Huang, Andréa Cynthia Santos
, Christophe Duhamel
:
Methods for solving road network problems with disruptions. Electron. Notes Discret. Math. 64: 175-184 (2018) - Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte Jaumard:
Energy-Efficient Service Function Chain Provisioning. Electron. Notes Discret. Math. 64: 265-274 (2018) - Zhiyuan Lin, Raymond S. K. Kwan:
Redundant Coupling/decoupling in Train Unit Scheduling Optimization. Electron. Notes Discret. Math. 64: 45-54 (2018) - Ali Ridha Mahjoub, Mohamed Yassine Naghmouchi, Nancy Perrot:
A Bilevel Programming Model for Proactive Countermeasure Selection in Complex ICT Systems. Electron. Notes Discret. Math. 64: 295-304 (2018) - Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos
:
Optimizing allocation in a warehouse network. Electron. Notes Discret. Math. 64: 195-204 (2018) - Fabrizio Marinelli, Andrea Pizzuti
:
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing. Electron. Notes Discret. Math. 64: 25-34 (2018) - Maddalena Nonato, Davide Bertozzi, Marco Gavanelli
, Andrea Peano:
A network model for routing-fault-free wavelength selection in WRONoCs design. Electron. Notes Discret. Math. 64: 285-294 (2018) - Temel Öncan, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electron. Notes Discret. Math. 64: 5-14 (2018) - Guido Perboli
, Roberto Tadei
, Edoardo Fadda
:
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem. Electron. Notes Discret. Math. 64: 75-84 (2018)
skipping 8 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-02 00:23 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