0305-0548

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

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

Knapsack problems — An overview of recent advances. Part I: Single knapsack problems

Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems

Set covering problem with conflict constraints

Reinforcement learning based tabu search for the minimum load coloring problem

Integrating order delivery and return operations for order fulfillment in an online retail environment

Data-driven project portfolio selection: Decision-dependent stochastic programming formulations with reliability and time to market requirements

A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance

A reduction tree approach for the Discrete Time/Cost Trade-Off Problem

The pickup and delivery problem with alternative locations and overlapping time windows

A fresh look at the Traveling Salesman Problem with a Center

Multi-objective parallel adjacent U-shaped assembly line balancing collaborated by robots and normal and disabled workers

Multi-output Support Vector Frontiers

The doubly open park-and-loop routing problem

Bi-objective optimization for road vertical alignment design

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem

A MILP approach to DRAM access worst-case analysis

A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows

Boosting ant colony optimization via solution prediction and machine learning

Risk-averse hub location: Formulation and solution approach

A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations

Time dependent orienteering problem with time windows and service time dependent profits

Enhancing mass transit passenger safety during a pandemic via in-vehicle time minimization

Extensions to the Weber problem

New formulations and solution approaches for the latency location routing problem

A Greedy Randomized Adaptive Search Procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem

Generating a robust baseline schedule for the robust discrete time/resource trade-off problem under work content uncertainty

Improving lower bounds for equitable chromatic number

Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times

A theoretical minimal solution for heuristics: The case of the spatial harvest timber problem

Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem