![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 32 matches
- 2014
- Ali Allahverdi, Harun Aydilek
, Asiye Aydilek
:
Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Comput. Oper. Res. 51: 200-207 (2014) - Enrico Angelelli
, Nicola Bianchessi
, Carlo Filippi
:
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51: 268-281 (2014) - Cesar Beltran-Royo
, Laureano F. Escudero
, Juan F. Monge
, R. E. Rodriguez-Ravines:
An effective heuristic for multistage linear programming with a stochastic right-hand side. Comput. Oper. Res. 51: 237-250 (2014) - Mohand Lounes Bentaha
, Olga Battaïa
, Alexandre Dolgui
:
A sample average approximation method for disassembly line balancing problem under uncertainty. Comput. Oper. Res. 51: 111-122 (2014) - Luis Cadarso
, Ángel Marín:
Improving robustness of rolling stock circulations in rapid transit networks. Comput. Oper. Res. 51: 146-159 (2014) - Diego Cattaruzza
, Nabil Absi
, Dominique Feillet
, Daniele Vigo
:
An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Comput. Oper. Res. 51: 257-267 (2014) - Dieter Claeys, Joris Walraevens
, Bart Steyaert, Herwig Bruneel:
Applicability of a static model in a dynamic context in group-screening decision making. Comput. Oper. Res. 51: 313-322 (2014) - Ketan Date, Suryaansh Makked
, Rakesh Nagi
:
Dominance rules for the optimal placement of a finite-size facility in an existing layout. Comput. Oper. Res. 51: 182-189 (2014) - Benoît Dupont de Dinechin, Alix Munier Kordon:
Converging to periodic schedules for cyclic scheduling problems with resources and deadlines. Comput. Oper. Res. 51: 227-236 (2014) - Abraham Duarte
, Manuel Laguna, Rafael Martí
, Jesús Sánchez-Oro
:
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem. Comput. Oper. Res. 51: 123-129 (2014) - Fatih Kiliç, Mustafa Gök
:
A demand based route generation algorithm for public transit network design. Comput. Oper. Res. 51: 21-29 (2014) - Fatih Kocatürk
, Özgür Özpeynirci:
Variable neighborhood search for the pharmacy duty scheduling problem. Comput. Oper. Res. 51: 218-226 (2014) - Anis Kooli, Mehdi Serairi:
A mixed integer programming approach for the single machine problem with unequal release dates. Comput. Oper. Res. 51: 323-330 (2014) - Heinrich Kuhn, Thomas Liske:
An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy. Comput. Oper. Res. 51: 30-40 (2014) - Wen-Chiung Lee, Jen-Ya Wang
:
A scheduling problem with three competing agents. Comput. Oper. Res. 51: 208-217 (2014) - Adam N. Letchford
, Saeideh D. Nasiri, Amar Oukil
:
Pricing routines for vehicle routing with time windows on road networks. Comput. Oper. Res. 51: 331-337 (2014) - Chang-Chun Lin
, Yen-I Chiang
, Shih-Wei Lin
:
Efficient model and heuristic for the intermodal terminal location problem. Comput. Oper. Res. 51: 41-51 (2014) - Shih-Wei Lin
, Kuo-Ching Ying
:
ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Comput. Oper. Res. 51: 172-181 (2014) - Peihai Liu
, Xiwen Lu:
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan. Comput. Oper. Res. 51: 251-256 (2014) - Stephen J. Maher, Guy Desaulniers
, François Soumis:
Recoverable robust single day aircraft maintenance routing problem. Comput. Oper. Res. 51: 130-145 (2014) - Reza Maihami
, Behrooz Karimi
:
Optimizing the pricing and replenishment policy for non-instantaneous deteriorating items with stochastic demand and promotional efforts. Comput. Oper. Res. 51: 302-312 (2014) - Franco Mascia, Manuel López-Ibáñez
, Jérémie Dubois-Lacoste, Thomas Stützle
:
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Comput. Oper. Res. 51: 190-199 (2014) - Chi-Kong Ng, Duan Li
:
Test problem generator for unconstrained global optimization. Comput. Oper. Res. 51: 338-349 (2014) - Gigyoung Park, Youngho Lee, Junghee Han:
A two-level location-allocation problem in designing local access fiber optic networks. Comput. Oper. Res. 51: 52-63 (2014) - Bert Réveil, Dieter Claeys, Tom Maertens, Joris Walraevens
, Herwig Bruneel:
Impact of class clustering in a multiclass FCFS queue with order-dependent service times. Comput. Oper. Res. 51: 90-98 (2014) - Subhash C. Sarin, Hanif D. Sherali, Jason D. Judd, Pei-Fang Jennifer Tsai:
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. Comput. Oper. Res. 51: 64-89 (2014) - Tadeusz Sawik
:
Optimization of cost and service level in the presence of supply chain disruption risks: Single vs. multiple sourcing. Comput. Oper. Res. 51: 11-20 (2014) - Li Sun, Gail W. DePuy, Gerald W. Evans
:
Multi-objective optimization models for patient allocation during a pandemic influenza outbreak. Comput. Oper. Res. 51: 350-359 (2014) - Rudolf Vetschera
, Paula Sarabando, Luis C. Dias
:
Levels of incomplete information in group decision models - A comprehensive simulation study. Comput. Oper. Res. 51: 160-171 (2014) - Tse-Chiu Wong
, Mai Xu, Kwai-Sang Chin
:
A two-stage heuristic approach for nurse scheduling problem: A case study in an emergency department. Comput. Oper. Res. 51: 99-110 (2014)
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-21 06:38 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