![](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 34 matches
- 2012
- Francisco J. Arcelus, Satyendra Kumar, Gopalan Srinivasan:
Bicriteria optimization in the newsvendor problem with uniformly distributed demand. 4OR 10(3): 267-286 (2012) - Ruibin Bai
, Jacek Blazewicz
, Edmund K. Burke
, Graham Kendall
, Barry McCollum:
A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR 10(1): 43-66 (2012) - Lucio Bianco, Massimiliano Caramia
:
Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm. 4OR 10(4): 361-377 (2012) - Salvatore Cannella
:
The impact of collaboration and smoothing replenishment rules on supply chain performance. 4OR 10(1): 109-110 (2012) - Rosella Castellano
, Rosella Giacometti
:
Credit default swaps: implied ratings versus official ones. 4OR 10(2): 163-180 (2012) - Yerim Chung, Marc Demange:
On inverse traveling salesman problems. 4OR 10(2): 193-209 (2012) - Sofian De Clercq, Bart Steyaert, Herwig Bruneel:
Delay analysis of a discrete-time multiclass slot-bound priority system. 4OR 10(1): 67-79 (2012) - Sergio Consoli
:
The development and application of metaheuristics for problems in graph theory: a computational study. 4OR 10(3): 319-320 (2012) - Fabio D'Andreagiovanni:
Pure 0-1 programming approaches to wireless network design. 4OR 10(2): 211-212 (2012) - Alexandre Dolgui
, Sergey Kovalev:
Min-max and min-max (relative) regret approaches to representatives selection problem. 4OR 10(2): 181-192 (2012) - Ángel Felipe
, M. Teresa Ortuño
, Gregorio Tirado:
An adapted heuristic approach for a clustered traveling salesman problem with loading constraints. 4OR 10(3): 245-265 (2012) - Fabio Furini:
Decomposition and reformulation of integer linear programming problems. 4OR 10(2): 219-220 (2012) - Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
Learning from conflicts in propositional satisfiability. 4OR 10(1): 15-32 (2012) - Mireille Jacomino, Minh-Hoang Le:
Robust energy planning in buildings with energy and comfort costs. 4OR 10(1): 81-103 (2012) - Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov
, Frank Werner
:
Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR 10(4): 347-360 (2012) - Hans Kellerer, Vitaly A. Strusevich:
The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10(2): 111-161 (2012) - Oumar Koné:
New approaches for solving the resource-constrained project scheduling problem. 4OR 10(1): 105-106 (2012) - Federico Liberatore:
Protection planning for critical infrastructure systems in location analysis: models and algorithms. 4OR 10(3): 315-316 (2012) - Leo Liberti
, Thierry Marchant, Silvano Martello:
No end of the world in 2012 for 4OR. 4OR 10(1): 1-13 (2012) - Arnaud Malapert:
Shop and batch scheduling with constraints. 4OR 10(4): 397-398 (2012) - Simona Mancini:
The two-echelon vehicle routing problem. 4OR 10(4): 391-392 (2012) - Franco Mascia:
Analysis of reactive search optimisation techniques for the maximum clique problem and applications. 4OR 10(2): 217-218 (2012) - Takashi Matsuhisa
:
A characterisation of stable sets in preordered structure. 4OR 10(1): 33-41 (2012) - Rina Mary Mazza:
Simulation-based optimization in port logistics. 4OR 10(3): 313-314 (2012) - Fabrice Talla Nobibon:
Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics. 4OR 10(1): 107-108 (2012) - Alberto Del Pia
, Robert Weismantel:
Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3): 221-244 (2012) - Daniel Cosmin Porumbel:
Heuristic algorithms and learning techniques: applications to the graph coloring problem. 4OR 10(4): 393-394 (2012) - Michael Poss
:
Models and algorithms for network design problems. 4OR 10(2): 215-216 (2012) - Luigi Di Puglia Pugliese:
Models and methods for the constrained shortest path problem and its variants. 4OR 10(4): 395-396 (2012) - Franz Rendl:
Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR 10(4): 321-346 (2012)
skipping 4 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-06-23 08:33 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