![](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 43 matches
- 2018
- Wim van Ackooij, Claudia D'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos
, Sonia Toubaline:
Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electron. Notes Discret. Math. 69: 309-316 (2018) - Bernardetta Addis
, Meihui Gao, Giuliana Carello
:
On the complexity of a Virtual Network Function Placement and Routing problem. Electron. Notes Discret. Math. 69: 197-204 (2018) - Víctor M. Albornoz
, Cristian Urrutia-Gutiérrez:
A mixed-integer linear optimization model for a two-echelon agribusiness supply chain. Electron. Notes Discret. Math. 69: 253-260 (2018) - Rafael Andrade, Jefferson Gurguri:
Models and cutting-plane strategies for the tree-star problem. Electron. Notes Discret. Math. 69: 261-268 (2018) - Rafael Castro de Andrade, Rommel Dias Saraiva
:
An integer linear programming model for the constrained shortest path tour problem. Electron. Notes Discret. Math. 69: 141-148 (2018) - Roberto Aringhieri
, Davide Duma, Enrico Faccio:
Ex post evaluation of an operating theatre. Electron. Notes Discret. Math. 69: 157-164 (2018) - Saverio Basso, Alberto Ceselli
:
Computational evaluation of ranking models in an automatic decomposition framework. Electron. Notes Discret. Math. 69: 245-252 (2018) - Alessandra Berto, Stefano Gliozzi:
Unconstraining the Passenger Demand for Rail Yield Management at Trenitalia. Electron. Notes Discret. Math. 69: 269-276 (2018) - Maria Elena Bruni
, Patrizia Beraldi, Sara Khodaparasti:
A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty. Electron. Notes Discret. Math. 69: 221-228 (2018) - Valentina Cacchiani
, Enrico Malaguti, Antonio Mauttone, Paolo Toth:
Preface. Electron. Notes Discret. Math. 69: 1-3 (2018) - Héctor Cancela
, Pedro Piñeyro, Joaquín Velázquez:
A MILP formulation for a tire curing scheduling problem. Electron. Notes Discret. Math. 69: 61-68 (2018) - Jessica Andrea Carballido
, Macarena A. Latini, Ignacio Ponzoni
, Rocío L. Cecchini
:
An Evolutionary Algorithm for Automatic Recommendation of Clustering Methods and its Parameters. Electron. Notes Discret. Math. 69: 229-236 (2018) - Marco Casazza
, Alberto Ceselli
, Roberto Wolfler Calvo:
A branch and price approach for the Split Pickup and Split Delivery VRP. Electron. Notes Discret. Math. 69: 189-196 (2018) - Yuxin Che, Ying Liu, Qiang Gao, Andrew Lim
, Qian Hu:
The Single Polybag Loading Problem. Electron. Notes Discret. Math. 69: 69-76 (2018) - Fernanda Couto
, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Chordal-(2, 1) graph sandwich problem with boundary conditions. Electron. Notes Discret. Math. 69: 277-284 (2018) - Luís Felipe I. Cunha, Fábio Protti:
Closure of genomic sets: applications of graph convexity to genome rearrangement problems. Electron. Notes Discret. Math. 69: 285-292 (2018) - J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi
:
Self-sufficient sets in smartgrids. Electron. Notes Discret. Math. 69: 301-308 (2018) - Hans Degroote, José Luis González Velarde, Patrick De Causmaecker
:
Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem. Electron. Notes Discret. Math. 69: 205-212 (2018) - Samuel Deleplanque
:
Maintenance on the Railway Network: Disruptions and re-scheduling. Electron. Notes Discret. Math. 69: 109-116 (2018) - Fabián Díaz-Núñez, Franco Quezada, Óscar C. Vásquez
:
The knapsack problem with scheduled items. Electron. Notes Discret. Math. 69: 293-300 (2018) - Graciela Ferreira, Franco Robledo, Pablo Romero
:
An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes. Electron. Notes Discret. Math. 69: 173-180 (2018) - Carla De Francesco, Luigi De Giovanni, Claudio Enrico Palazzi
:
The Interference-aware Drone Ad-hoc Relay Network Configuration problem. Electron. Notes Discret. Math. 69: 317-324 (2018) - Antonio Frangioni
, Laura Galli, Giovanni Stea
:
Towards Robust Admission Control in Delay-Constrained Routing Problems. Electron. Notes Discret. Math. 69: 45-52 (2018) - Martin Josef Geiger
:
Algorithms, pseudo-codes, implementations - some reflections on interdependencies and potential implications. Electron. Notes Discret. Math. 69: 37-44 (2018) - Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni
:
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks. Electron. Notes Discret. Math. 69: 237-244 (2018) - Márton Gyetvai, Kolos Csaba Ágoston
:
Optimization of transition rules in a Bonus-Malus system. Electron. Notes Discret. Math. 69: 5-12 (2018) - Jeremy D. Jordan, Jeffery D. Weir:
Average Longest Path and Maximum Cost Network Flows with Multiple-Criteria Weights. Electron. Notes Discret. Math. 69: 181-188 (2018) - Gonzalo Lera-Romero, Juan José Miranda Bront
:
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. Electron. Notes Discret. Math. 69: 53-60 (2018) - Guillermo De Ita Luna, Cristina López-Ramírez, Meliza Contreras González:
Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability. Electron. Notes Discret. Math. 69: 101-108 (2018) - Federico Malucelli, Emanuele Tresoldi
, Maddalena Nonato:
Designing Pedibus Lines: a Path Based Approach. Electron. Notes Discret. Math. 69: 149-156 (2018)
skipping 13 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 11:05 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