0305-0548

Computers & Operations Research （COR） - Volume 78 论文列表

点击这里查看 Computers & Operations Research 的JCR分区、影响因子等信息
卷期号： Volume 78
发布时间： February 2017
卷期年份： 2017
卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/78/suppl/C
本期论文列表
Title Page/Editorial Board

An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem

Bi-dimensional knapsack problems with one soft constraint

Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile

Analysis of FPTASes for the multi-objective shortest path problem

Measure of bullwhip effect in supply chains with first-order bivariate vector autoregression time-series demand model

Breakout local search for the multi-objective gate allocation problem

A novel adaptive control strategy for decomposition-based multiobjective algorithm

Tool-feeder partitions for module assignment in PCB assembly

Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times

Intelligent-guided adaptive search for the maximum covering location problem

MIP-based approaches for robust storage loading problems with stacking constraints

An interactive approach for multiple criteria selection problem

A novel discretization scheme for the close enough traveling salesman problem

MaxSAT-based large neighborhood search for high school timetabling

New approximate algorithms for the customer order scheduling problem with total completion time objective

Minimizing deviation from scheduled times in a single mixed-operation runway

Application of an iterative framework for real-time railway rescheduling

A two-resource allocation algorithm with an application to large-scale zero-sum defensive games

A comparative study of formulations and solution methods for the discrete ordered p-median problem

GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem

A quality and distance guided hybrid algorithm for the vertex separator problem

A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center

A constraint-programming-based approach for solving the data dissemination problem

Logic based Benders' decomposition for orthogonal stock cutting problems

Partial evaluation in Rank Aggregation Problems

A planar single-facility competitive location and design problem under the multi-deterministic choice rule

On the analytic assessment of the impact of traffic correlation on queues in continuous time domain

Exploring the interaction of inventory policies across the supply chain: An agent-based approach

Emergency medical services and beyond: Addressing new challenges through a wide literature review

Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach

An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming

Special issue on Variable neighborhood search methods in business and engineering

Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems

Bi-objective optimisation model for installation scheduling in offshore wind farms

A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints

Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks

Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system

Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem

The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search

A general variable neighborhood search for the swap-body vehicle routing problem

A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations

Variable Neighborhood Search strategies for the Order Batching Problem

An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem

A VNS approach to multi-location inventory redistribution with vehicle routing

Solving multifacility Huff location models on networks using metaheuristic and exact approaches

A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem

Variable neighborhood search variants for Min-power symmetric connectivity problem

Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign