![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Computers & Operations Research, Volume 133
Volume 133, September 2021
- Mir Ehsan Hesam Sadati
, Bülent Çatay, Deniz Aksen:
An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. 105269 - Weili Zeng
, Yumeng Ren, Wenbin Wei, Zhao Yang:
A data-driven flight schedule optimization model considering the uncertainty of operational displacement. 105328 - David Freud, Gur Mosheiov:
Scheduling with competing agents, total late work and job rejection. 105329 - Leopoldo Eduardo Cárdenas-Barrón, Buddhadev Mandal, Joaquín Sicilia, Luis Augusto San-José
, Beatriz Abdul-Jalbar
:
Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern. 105339 - Petra Groselj
:
Symmetric projection group approach for promoting homogeneity in the analytic hierarchy process. 105343 - Anurag Ladage
, Davaatseren Baatar, Mohan Krishnamoorthy, Ashutosh Mahajan:
A revised formulation, library and heuristic for a chemical tanker scheduling problem. 105345 - Yongzhen Li, Yuqin Lin, Jia Shu:
Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs. 105347 - A. Baskar, M. Anthony Xavior
:
New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems. 105348 - Manoel B. Campêlo, Tatiane Fernandes Figueiredo
:
Integer programming approaches to the multiple team formation problem. 105354 - Denise D. Tönissen
, Loe Schlicher
:
Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem. 105356 - Ricardo Gama
, Hugo L. Fernandes:
A reinforcement learning approach to the orienteering problem with time windows. 105357 - Charis Ntakolia
, Dimitris K. Iakovidis:
A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning. 105358 - Simona Mancini
, Margaretha Gansterer:
Vehicle routing with private and shared delivery locations. 105361 - Martin Hughes, Marc Goerigk
, Trivikram Dokka
:
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. 105364 - Saeideh Salimpour, Hani Pourvaziri, Ahmed Azab
:
Semi-robust layout design for cellular manufacturing in a dynamic environment. 105367 - Padraig Corcoran, Andrei Gagarin:
Heuristics for k-domination models of facility location problems in street networks. 105368 - Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia
, Marco César Goldbarg:
Multi- and many-objective path-relinking: A taxonomy and decomposition approach. 105370 - Mathijs van Zon, Guy Desaulniers
:
The joint network vehicle routing game with optional customers. 105375 - Peter B. Keenan
, Javier Panadero
, Angel A. Juan
, Rafael Martí, Seán McGarraghy:
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands. 105377 - Shaoxiang Zheng, Naiming Xie
, Qiao Wu:
Single batch machine scheduling with dual setup times for autoclave molding manufacturing. 105381 - Consuelo Parreño-Torres
, Hatice Çalik
, Ramón Alvarez-Valdés, Rubén Ruiz:
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. 105383 - Raslan Kain
, Daniele Manerba, Roberto Tadei:
The index selection problem with configurations and memory limitation: A scatter search approach. 105385
![](https://dblp.dagstuhl.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.