0305-0548

Computers & Operations Research (COR) - Volume 40, Issue 8 论文列表

本期论文列表
Title Page/Editorial Board

Modeling and optimization of a product-service system with additional service capacity and impatient customers

Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning

A hybrid metaheuristic approach for the rollon–rolloff vehicle routing problem

Models for the two-dimensional two-stage cutting stock problem with multiple stock size

A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem

A stochastic optimization model for real-time ambulance redeployment

Taking advantage of a diverse set of efficient production schedules: A two-step approach for scheduling with side concerns

Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic

Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows

Headquarter-centered common sourcing management through order coordination and consolidation

Using the primal-dual interior point algorithm within the branch-price-and-cut method

Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation

Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Branch-and-bound algorithm for a competitive facility location problem

Makespan minimization flowshop with position dependent job processing times—computational complexity and solution algorithms

Hybrid evolutionary computation methods for quay crane scheduling problems

Achieving MILP feasibility quickly using general disjunctions

The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

A tabu method for a two-agent single-machine scheduling with deterioration jobs

Robust vertex p-center model for locating urgent relief distribution centers

A vendor managed inventory model under contractual storage agreement

Improved bounds for large scale capacitated arc routing problem

A note: Minmax due-date assignment problem with lead-time cost