Title Page/Editorial Board
Editorial
Multistart algorithms for seeking feasibility
Improving solver success in reaching feasibility for sets of nonlinear constraints
Efficient interval partitioning—Local search collaboration for constraint satisfaction
Repairing MIP infeasibility through local branching
Generalized filtering algorithms for infeasibility analysis
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
Infeasibility resolution based on goal programming
A reformulation–linearization–convexification algorithm for optimal correction of an inconsistent system of linear constraints
The Q method for second order cone programming
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
Integrating multi-product production and distribution in newspaper logistics
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
Cell suppression problem: A genetic-based approach
Ranking of units on the DEA frontier with common weights
Statistical confidentiality: Optimization techniques to protect tables
Single-machine group scheduling problems with deterioration consideration
Comparing methods for multiattribute decision making with ordinal weights
Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
Minimizing makespan on an m-machine re-entrant flowshop
Exponential neighborhood search for a parallel machine scheduling problem
Bi-dynamic constraint aggregation and subproblem reduction
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
PERM for solving circle packing problem
