Title Page/Editorial Board
A simple randomized algorithm for two-dimensional strip packing
Scenario construction and reduction applied to stochastic power generation expansion planning
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
Solving software project scheduling problems with ant colony optimization
Variable neighborhood search for location routing
High density packings of equal circles in rectangles with variable aspect ratio
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
Weighted tardiness for the single machine scheduling problem:An examination of precedence theorem productivity
A decomposition approach for the car resequencing problem with selectivity banks
Scheduling problems with two competing agents to minimized weighted earliness–tardiness
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Insertion based Lin–Kernighan heuristic for single row facility layout
Branch and bound for the cutwidth minimization problem
Supervised classification and mathematical optimization
Memetic search for the max-bisection problem
Online interval scheduling on a single machine with finite lookahead
Breakout Local Search for maximum clique problems
An efficient hybrid meta-heuristic for aircraft landing problem
Vehicle routing problem with stochastic travel times including soft time windows and service costs
Solution approaches for the cutting stock problem with setup cost
A single machine carryover sequence-dependent group scheduling in PCB manufacturing
A theoretical development for the total tardiness problem and its application in branch and bound algorithms
Heuristics for dynamic and stochastic routing in industrial shipping
Heuristics for the multi-item capacitated lot-sizing problem with lost sales
Mixed Integer Non-Linear Programming models for Green Network Design
BSTBGA: A hybrid genetic algorithm for constrained multi-objective optimization problems
Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
An effective lower bound on Lmax in a worker-constrained job shop
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0–1 optimization
On an exact method for the constrained shortest path problem
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
An exact method for scheduling of the alternative technologies in R&D projects
Solution method for the location planning problem of logistics park with variable capacity
An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
A new heuristic for solving the p-median problem in the plane
A heuristic method for two-stage hybrid flow shop with dedicated machines
The r-interdiction median problem with probabilistic protection and its solution algorithm
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
Two-server parallel system with pure space sharing and Markovian arrivals
Addendum to the paper entitled “A mixed 0–1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon”
