5 | -- | 8 | . Preface to the Special Issue on Matheuristics and Metaheuristics |
9 | -- | 25 | Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni. A learn-and-construct framework for general mixed-integer programming problems |
26 | -- | 56 | Ana Anokic, Zorica Stanimirovic, Tatjana Davidovic, Dorde Stakic. Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture |
57 | -- | 90 | Davide Armellini, Paolo Borzone, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf. Modeling and solving the steelmaking and casting scheduling problem |
91 | -- | 111 | Christian Blum 0001. Minimum common string partition: on solving large-scale problem instances |
112 | -- | 137 | Jonatas B. C. Chagas, Ulisses Eduardo Ferreira da Silveira, André G. Santos 0001, Marcone J. F. Souza. A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks |
138 | -- | 167 | Ripon Kumar Chakrabortty, Alireza Abbasi, Michael J. Ryan. Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic |
168 | -- | 196 | Jeroen Corstjens, Benoît Depaire, An Caris, Kenneth Sörensen. A multilevel evaluation method for heuristics with an application to the VRPTW |
197 | -- | 218 | Victor Cunha, Iuri Santos, Luciana Pessoa, Silvio Hamacher. An ILS heuristic for the ship scheduling problem: application in the oil industry |
219 | -- | 244 | Nicolas Dupin, El-Ghazali Talbi. Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints |
245 | -- | 266 | Dusan Dzamic, Jun Pei, Miroslav Maric, Nenad Mladenovic, Panos M. Pardalos. Exponential quality function for community detection in complex networks |
267 | -- | 290 | Júlia Cária de Freitas, Puca Huachi Vaz Penna. A variable neighborhood search for flying sidekick traveling salesman problem |
291 | -- | 313 | Sana Frifita, Malek Masmoudi. VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties |
314 | -- | 335 | Aljoscha Gruler, Javier Panadero, Jésica de Armas, José A. Moreno-Pérez, Angel A. Juan. A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands |
336 | -- | 360 | Alberto Herran, José Manuel Colmenar, Rafael Martí, Abraham Duarte. A parallel variable neighborhood search approach for the obnoxious p-median problem |
361 | -- | 380 | Chandra Ade Irawan, Arif Imran, Martino Luis. Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS |
381 | -- | 393 | Alexander V. Kononov, Polina A. Kononova, Alexander Gordeev. Branch-and-bound approach for optima localization in scheduling multiprocessor jobs |
394 | -- | 417 | Jens Lysgaard, Ana Dolores López-Sánchez, Alfredo García Hernández-Díaz. A matheuristic for the MinMax capacitated open vehicle routing problem |
418 | -- | 434 | André L. Maravilha, Eduardo G. Carrano, Felipe Campelo. A recombination-based matheuristic for mixed integer programming problems with binary variables |
435 | -- | 457 | Bernardo Martín, Ángel Sánchez, Cesar Beltran-Royo, Abraham Duarte. Solving the edge-disjoint paths problem using a two-stage method |
458 | -- | 479 | Johannes Maschler, Günther R. Raidl. Particle therapy patient scheduling with limited starting time variations of daily treatments |
480 | -- | 493 | Nenad Mladenovic, Abdulaziz Alkandari, Jun Pei, Raca Todosijevic, Panos M. Pardalos. Less is more approach: basic variable neighborhood search for the obnoxious p-median problem |
494 | -- | 524 | Fabricio Oliveira, Jeffrey Christiansen, Brian Dandurand, Andrew C. Eberhard. Combining penalty-based and Gauss-Seidel methods for solving stochastic mixed-integer problems |
525 | -- | 548 | Tu-San Pham, Pieter Leyman, Patrick De Causmaecker. The intermittent travelling salesman problem |
549 | -- | 572 | Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho. Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls |
573 | -- | 613 | Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl. An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem |
614 | -- | 650 | Eduardo Camargo de Siqueira, Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza. An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem |
651 | -- | 664 | Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui, Saïd Hanafi. Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem |
665 | -- | 695 | Yixin Zhao, Torbjörn Larsson, Elina Rönnberg. An integer programming column generation principle for heuristic search methods |
696 | -- | 0 | Mario Guajardo, Teodor Gabriel Crainic, Debjit Roy, Stein W. Wallace. Special issue on "Transportation and Logistics with Autonomous Technologies" |
697 | -- | 698 | Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen. Special issue on "Stochastic Local Search: Recent developments and trends" |
699 | -- | 700 | . Special issue on "OR and Big Data in Agriculture" |
701 | -- | 702 | . Special issue on "Metaheuristics" |
703 | -- | 704 | . Special issue on "Mind and Cognition in the Future of Decision Support Systems" |