0305-0548

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

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

An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics

Dimensioning a queue with state-dependent arrival rates

Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry

A mixed integer linear programming model for multi-sector planning using speed and heading changes

Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction

Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs

Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design

A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace

Optimal policy for an inventory system with demand dependent on price, time and frequency of advertisement

Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem

Optimization algorithms for resilient path selection in networks

Tree optimization based heuristics and metaheuristics in network construction problems

Container liner shipping network design with shipper’s dual preference

A hybrid algorithm for time-dependent vehicle routing problem with time windows

On the multisource hyperplanes location problem to fitting set of points

A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing

Scheduling taxi services for a team of car relocators

Preprocessing and cutting planes with conflict graphs

Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm

Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees

Revisiting where are the hard knapsack problems? via Instance Space Analysis

Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches

Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs

Improving solution times for stable matching problems through preprocessing

Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants

IoT and digital twin enabled smart tracking for safety management