No. 27-1, January 2020
Index
- A learn‐and‐construct framework for general mixed‐integer programming problems
- A matheuristic for the MinMax capacitated open vehicle routing problem
- A multilevel evaluation method for heuristics with an application to the VRPTW
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- A variable neighborhood search for flying sidekick traveling salesman problem
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- An ILS heuristic for the ship scheduling problem: application in the oil industry
- An integer programming column generation principle for heuristic search methods
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- Exponential quality function for community detection in complex networks
- Issue Information
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Minimum common string partition: on solving large‐scale problem instances
- Modeling and solving the steelmaking and casting scheduling problem
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Particle therapy patient scheduling with limited starting time variations of daily treatments
- Preface to the Special Issue on Matheuristics and Metaheuristics
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- Solving the edge‐disjoint paths problem using a two‐stage method
- Special issue on “Metaheuristics”
- Special issue on “Mind and Cognition in the Future of Decision Support Systems”
- Special issue on “OR and Big Data in Agriculture”
- Special issue on “Stochastic Local Search: Recent developments and trends”
- Special issue on “Transportation and Logistics with Autonomous Technologies”
- The intermittent travelling salesman problem
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties