Computers & Operations Research （COR） - Volume 77 论文列表
| 点击这里查看 Computers & Operations Research 的JCR分区、影响因子等信息 |
| 卷期号： Volume 77 |
| 发布时间： January 2017 |
| 卷期年份： 2017 |
| 卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/77/suppl/C |
本期论文列表
Title Page/Editorial Board
The boolean quadratic programming problem with generalized upper bound constraints
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping
Lane covering with partner bounds in collaborative truckload transportation procurement
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem
Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
A knowledge-based approach for multi-factory production systems
Home health care routing and scheduling: A review
Reduction of permutation flowshop problems to single machine problems using machine dominance relations
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
The pickup and delivery problem with time windows and handling operations
Matheuristics for the single-path design-balanced service network design problem
An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
Probabilistic optimization via approximate p-efficient points and bundle methods
Approximated set-valued mapping approach for handling multiobjective bilevel problems
Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing
An iterated “hyperplane exploration” approach for the quadratic knapsack problem
Least squares approximate policy iteration for learning bid prices in choice-based revenue management
Vehicle routing with cross-dock selection
Optimal decisions for continuous time Markov decision processes over finite planning horizons