0305-0548

Computers & Operations Research (COR) - Volume 43 论文列表

本期论文列表
Title Page/Editorial Board

Emergency railway wagon scheduling by hybrid biogeography-based optimization

An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark

GRASP for the uncapacitated r-allocation p-hub median problem

Enhanced controlled tabular adjustment

Computation and application of the paired combinatorial logit stochastic user equilibrium problem

Generalized quadratic multiple knapsack problem and two solution approaches

Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design

A beam search approach to the container loading problem

Low-discrepancy sampling for approximate dynamic programming with local approximators

A Lagrangian heuristic for sprint planning in agile software development

The vehicle rescheduling problem

Protection issues for supply systems involving random attacks

A holonic approach to flexible flow shop scheduling under stochastic processing times

Differential evolution methods based on local searches

Analysis and optimization of Guard Channel Policy in cellular mobile networks with account of retrials

Recursive central rounding for mixed integer programs

Reducing the solution space of optimal task scheduling

A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time

A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery

Generalized route planning model for hazardous material transportation with VaR and equity considerations

A two-stage approach to the orienteering problem with stochastic weights

A derandomized approximation algorithm for the critical node detection problem

Optimizing the strategic patient mix combining queueing theory and dynamic programming

A mixed integer linear model for clustering with variable selection

Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances

Flowshop scheduling with a general exponential learning effect

Location-arc routing problem: Heuristic approaches and test instances

A memetic algorithm for the Minimum Sum Coloring Problem

A nested heuristic for parameter tuning in Support Vector Machines

Evaluating and optimizing resilience of airport pavement networks