default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 86
Volume 86, October 2017
- Rafal Skinderowicz
:
An improved Ant Colony System for the Sequential Ordering Problem. 1-17 - Rafael de Santiago, Luís C. Lamb:
Exact computational solution of Modularity Density Maximization by effective column generation. 18-29 - Weng-Ming Chu, Koan-Yuh Chang:
Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks. 30-40 - Xiao-Lu Liu, Gilbert Laporte, Yingwu Chen, Renjie He:
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time. 41-53 - B. Srirangacharyulu:
Completion time variance minimisation on two identical parallel processors. 54-64 - Yi Zhou, Jin-Kao Hao:
Frequency-driven tabu search for the maximum s-plex problem. 65-78 - Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
A decomposition approach for the p-median problem on disconnected graphs. 79-85 - Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. 86-93 - Arild Hoff, Juanjo Peiró, Ángel Corberán, Rafael Martí:
Heuristics for the capacitated modular hub location problem. 94-109 - Pengli Ji, Kun He, Yan Jin, Hongsheng Lan, Chumin Li:
An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. 110-123 - Fanrong Xie, Muhammad Munir Butt, Zuoan Li:
A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem. 124-139
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 2026-07-24 23:11 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
