Editorial Board
GLNS: An effective large neighborhood search heuristic for the Generalized Traveling Salesman Problem
Airline flight schedule planning under competition
A stochastic model for the throughput analysis of passing dual yard cranes
Large-scale vehicle routing problems: Quantum Annealing, tunings and results
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
M/G/c/c state dependent queuing model for a road traffic system of two sections in tandem
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
A multi-phase heuristic for the production routing problem
Competitive Liner Shipping Network Design
Lagrangian relaxation for SVM feature selection
Expressiveness and robustness measures for the evaluation of an additive value function in multiple criteria preference disaggregation methods: An experimental analysis
A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint
Modeling and Computational Optimization for Complex System Management
DC programming and DCA for solving Brugnano–Casulli piecewise linear systems
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach
A clique covering MIP model for the irregular strip packing problem
DC programming and DCA for enhancing physical layer security via cooperative jamming
An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
Mathematical models and solution approach for cross-training staff scheduling at call centers
A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem
A Variable Neighborhood Search heuristic for the maximum ratio clique problem