Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 87
Volume 87, November 2017
- Stephen L. Smith
, Frank Imeson:
GLNS: An effective large neighborhood search heuristic for the Generalized Traveling Salesman Problem. 1-19 - Ahmed F. Abdelghany, Khaled F. Abdelghany, Farshid Azadian:
Airline flight schedule planning under competition. 20-39 - Suruchika Saini, Debjit Roy, René de Koster:
A stochastic model for the throughput analysis of passing dual yard cranes. 40-51 - Alex Syrichas, Alan Crispin:
Large-scale vehicle routing problems: Quantum Annealing, tunings and results. 52-62 - Eduardo Álvarez-Miranda, Markus Sinnl:
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems. 63-82 - Gintaras Palubeckis:
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem. 83-97 - Nacira Guerrouahane, Djamil Aïssani, Nadir Farhi, Louiza Bouallouche-Medjkoune:
M/G/c/c state dependent queuing model for a road traffic system of two sections in tandem. 98-106 - Sanne Wøhlk, Gilbert Laporte:
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. 107-113 - Oguz Solyali, Haldun Süral:
A multi-phase heuristic for the production routing problem. 114-124 - Christian Vad Karsten, Berit Dangaard Brouer, David Pisinger:
Competitive Liner Shipping Network Design. 125-136 - Manlio Gaudioso, Enrico Gorgone, Martine Labbé, Antonio M. Rodríguez-Chía:
Lagrangian relaxation for SVM feature selection. 137-145 - Milosz Kadzinski, Mohammad Ghaderi, Jakub Wasikowski, Núria Agell:
Expressiveness and robustness measures for the evaluation of an additive value function in multiple criteria preference disaggregation methods: An experimental analysis. 146-164 - Liang Liu, Maged M. Dessouky:
A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem. 165-182 - Tunzi Tan, Suixiang Gao, Juan A. Mesa:
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint. 183-193
- Le Thi Hoai An, Pham Dinh Tao:
Modeling and Computational Optimization for Complex System Management. 195 - Tao Pham Dinh, Vinh Thanh Ho, Hoai An Le Thi:
DC programming and DCA for solving Brugnano-Casulli piecewise linear systems. 196-204 - Deepak Gawali, Ahmed Zidna, P. S. V. Nataraj:
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach. 205-220 - Marcos Okamura Rodrigues, Franklina Maria Bragion Toledo:
A clique covering MIP model for the irregular strip packing problem. 221-234 - Thi Thuy Tran, Hoai An Le Thi, Tao Pham Dinh:
DC programming and DCA for enhancing physical layer security via cooperative jamming. 235-244 - Yang Yu, Qi Lou, Jiafu Tang, Junwei Wang, Xiaohang Yue:
An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution. 245-257 - Gamze Kilincli Taskiran, Xinhui Zhang:
Mathematical models and solution approach for cross-training staff scheduling at call centers. 258-269 - Rosita Guido, Domenico Conforti:
A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem. 270-282 - Dominik Goeke, Mahdi Moeini, David Poganiuch:
A Variable Neighborhood Search heuristic for the maximum ratio clique problem. 283-291
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-05-06 20:14 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:
