Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 114
Volume 114, February 2020
- Efrat Perel, Nir Perel
, Uri Yechiali:
A polling system with 'Join the shortest - serve the longest' policy. - David Rodríguez Rueda, Carlos Cotta, Antonio José Fernández Leiva:
Memetic collaborative approaches for finding balanced incomplete block designs. - Md Sarowar Morshed, Md. Noor-E-Alam:
Generalized affine scaling algorithms for linear programming problems. - Mauro Dell'Amico, Fabio Furini, Manuel Iori:
A branch-and-price algorithm for the temporal bin packing problem. - José Miguel Quesada Pérez, Jean-Sébastien Tancrez, Jean-Charles Lange:
Express shipment service network design with complex routes. - Ernesto G. Birgin, João Eduardo Ferreira, Débora P. Ronconi:
A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. - Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí:
Tabu search for min-max edge crossing in graphs. - Marko Djukanovic, Günther R. Raidl, Christian Blum:
Anytime algorithms for the longest common palindromic subsequence problem. - Lieke M. van der Heide, Leandro C. Coelho, Iris F. A. Vis, Roel G. van Anholt:
Replenishment and denomination mix of automated teller machines with dynamic forecast demands. - Lohic Fotio Tiotsop, Antonio Servetti, Enrico Masala:
An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision. - Asefe Forghani, Farzad Dehghanian, Majid Salari, Yousef Ghiami:
A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities. - Fabian Gnegel, Armin Fügenschuh:
An iterative graph expansion approach for the scheduling and routing of airplanes. - Dmitrii Usanov, Peter M. van de Ven, Rob D. van der Mei:
Dispatching fire trucks under stochastic driving times. - Guillaume Marquès, Ruslan Sadykov, Jean-Christophe Deschamps, Rémy Dupas:
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. - Julia Grübel, Thomas Kleinert, Vanessa Krebs, Galina Orlinskaya, Lars Schewe, Martin Schmidt, Johannes Thürauf:
On electricity market equilibria with storage: Modeling, uniqueness, and a distributed ADMM.
- Erdi Dasdemir, Murat Köksalan, Diclehan Tezcaner Öztürk:
A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem.
- M. K. Marichelvam, M. Geetha, Ömür Tosun:
An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - A case study.
a service of 
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.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
