Остановите войну!
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 73 matches
- 2019
- Bernard Fortz, Martine Labbé:
Operations Research Proceedings 2018, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Brussels, Belgium, September 12-14, 2018. Springer 2019, ISBN 978-3-030-18499-5 [contents] - 2018
- David Müller, Dominik Kress, Jenny Nossack:
Exact and Heuristic Solution Approaches for a Flexible Job Shop Scheduling Problem Incorporating Machine Operator Restrictions. OR 2018: 481-488 - Oussama Mazari Abdessameud, Filip Van Utterbeeck, Marie-Anne Guerry:
Military Manpower Planning Using a Career Path Approach Applied to the Belgian Defense. OR 2018: 51-57 - Lovis Anderson, Benjamin Hiller:
A Sweep-Plane Algorithm for the Computation of the Volume of a Union of Polytopes. OR 2018: 87-93 - Necati Aras, Berk Görgülü:
An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem. OR 2018: 301-307 - Philipp Armbrust, Philipp Hungerländer, Anna Jellen:
A Heuristic for the Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 2D and 3D Grids. OR 2018: 95-101 - Martin Bähr, Georg Radow, Michael Breuß, Armin Fügenschuh:
Computation of Stable Honeycomb Structures for Additive Manufacturing. OR 2018: 363-369 - Adrian Barea, Raúl de Celis, Luis Cadarso:
Integrated Optimisation for Descent Trajectory Operations and Airport Runway Assignment. OR 2018: 523-529 - Tristan Becker, Bastian Bruns, Stefan Lier, Brigitte Werners:
Tactical Planning of Modular Production Networks in the Chemical Industry: A Case Study in Specialty Polymers. OR 2018: 407-413 - Moritz Behrend, Frank Meisel:
Heterogeneity of Items in an Integrated Item-Sharing and Crowdshipping Setting. OR 2018: 269-275 - Marco Bender, Sebastian Berckey, Michael Elberfeld, Jörg Herbers:
Real-World Staff Rostering via Branch-and-Price in a Declarative Framework. OR 2018: 445-451 - Joanna Berlinska:
Scheduling in a Data Gathering Network to Minimize Maximum Lateness. OR 2018: 453-458 - Joachim Block, Stefan Pickl:
OR Control Towers: A Concept for Optimizing the Performance of Complex Adaptive Operating Systems. OR 2018: 491-497 - Valentin Bouquet, Kymble Christophe, François Delbot, Gaétan Le Chat, Jean-François Pradat-Peyre:
Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks. OR 2018: 243-249 - David Brück, Sven Oliver Krumke:
Validating Measurement Data in Manufacturing Processes. OR 2018: 415-420 - Paul Alexandru Bucur, Klaus Frick, Philipp Hungerländer:
Predicting the Vibroacoustic Quality of Steering Gears. OR 2018: 309-315 - Jan Busse, Julia Rieck:
Electricity Price-Oriented Scheduling Within Production Planning Stage. OR 2018: 161-166 - Dorothea Calmels, Chandrasekharan Rajendran, Hans Ziegler:
Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines. OR 2018: 459-465 - Peter Czimmermann, Lubos Buzna:
A Network Flow Formulation of the Location-Scheduling Problem for Electric Vehicle Charge Stations with Incomplete Information. OR 2018: 235-241 - Gauvain Devillez, Pierre Hauweele, Hadrien Mélot:
PHOEG Helps to Obtain Extremal Graphsch: 32. OR 2018: 251-257 - Reginald Dewil, Johan Philips, Jan Jaap Kempenaar, Dirk Cattrysse:
Modeling the Egg Packing Station Planning Problem. OR 2018: 421-426 - Oliver Frendo, Nadine Gaertner:
Real-Time Planning for Smart Charging of Electric Vehicle Fleets. OR 2018: 531-537 - Sarah Frisch, Philipp Hungerländer, Anna Jellen, Dominic Weinberger:
A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints. OR 2018: 103-109 - Armin Fügenschuh, Markus Bambach, Johannes Buhl:
Trajectory Optimization for Wire-Arc Additive Manufacturing. OR 2018: 331-337 - Patrick Gemander:
On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling. OR 2018: 3-9 - Bernard M. Gilroy, Alexander Golderbein, Christian Peitz, Nico Stoeckmann:
The Impact of Monetary Policy on Investment Bank Profitability in Unequal Economies. OR 2018: 201-208 - Fabian Gnegel, Armin Fügenschuh:
A Time-Flow Approach for Scheduling and Routing of Fly-in Safari Airplanes. OR 2018: 339-345 - Sebastian Goderbauer, Leonie Ermert:
Proportional Apportionment for Connected Coalitions. OR 2018: 111-118 - Steffen Goebbels, Regina Pohle-Fröhlich:
Beautification of City Models Based on Mixed Integer Linear Programming. OR 2018: 119-125 - Ralf Gössinger, Grigory Pishchulov, Imre Dobos:
Metamodel-Based Optimization of the Article-to-Device Assignment and Manpower Allocation Problem in Order Picking Warehouses. OR 2018: 277-284
skipping 43 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-05-08 20:54 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