AI大模型学习
AI博客
原创AI博客
大模型技术博客
AI大模型排行榜
业界大模型评测基准
全球大模型最新评测基准结果
大模型综合能力排行榜
大模型编程能力排行榜
LMSys ChatBot Arena排行榜
Berkeley大模型工具使用能力排行榜
OpenLLMLeaderboard中国站
全球大模型最新评测结果
AI大模型大全(新版)
AI大模型大全(新版)
AI大模型大全
AI大模型对比
2023年度AI产品总结
大模型部署教程
AI资源仓库
AI领域与任务
AI研究机构
AI数据集
AI开源工具
数据推荐
AI大模型
国产AI大模型生态全览
AI模型概览图
AI模型月报
AI基础大模型
AI大模型工具导航
AI大模型工具导航网站
在线聊天大模型列表
期刊列表
Computers & Operations Research
Volume 39, Issue 3
Computers & Operations Research
(COR)
-
Volume 39, Issue 3
论文列表
点击这里查看 Computers & Operations Research 的JCR分区、影响因子等信息
卷期号:
Volume 39, Issue 3
发布时间:
March 2012
卷期年份:
2012
卷期官网:
https://www.sciencedirect.com/journal/computers-and-operations-research/vol/39/issue/3
本期论文列表
Title Page/Editorial Board
原文链接
谷歌学术
必应学术
百度学术
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
原文链接
谷歌学术
必应学术
百度学术
Heuristic approaches for master planning in semiconductor manufacturing
原文链接
谷歌学术
必应学术
百度学术
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
原文链接
谷歌学术
必应学术
百度学术
Greedy algorithms for a class of knapsack problems with binary weights
原文链接
谷歌学术
必应学术
百度学术
An improved algorithm for the longest common subsequence problem
原文链接
谷歌学术
必应学术
百度学术
Inequality constraint handling in genetic algorithms using a boundary simulation method
原文链接
谷歌学术
必应学术
百度学术
Risk-averse two-stage stochastic programming with an application to disaster management
原文链接
谷歌学术
必应学术
百度学术
Performance evaluation of a synchronization station with multiple inputs and population constraints
原文链接
谷歌学术
必应学术
百度学术
Batch scheduling on uniform machines to minimize total flow-time
原文链接
谷歌学术
必应学术
百度学术
Simulated annealing for optimal ship routing
原文链接
谷歌学术
必应学术
百度学术
Makespan minimization on single batch-processing machine via ant colony optimization
原文链接
谷歌学术
必应学术
百度学术
Cliques with maximum/minimum edge neighborhood and neighborhood density
原文链接
谷歌学术
必应学术
百度学术
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction
原文链接
谷歌学术
必应学术
百度学术
Lagrangean relaxation heuristics for the p-cable-trench problem
原文链接
谷歌学术
必应学术
百度学术
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
原文链接
谷歌学术
必应学术
百度学术
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
原文链接
谷歌学术
必应学术
百度学术
Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
原文链接
谷歌学术
必应学术
百度学术
Single-machine makespan minimization scheduling with nonlinear shortening processing times
原文链接
谷歌学术
必应学术
百度学术
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
原文链接
谷歌学术
必应学术
百度学术
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
原文链接
谷歌学术
必应学术
百度学术
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
原文链接
谷歌学术
必应学术
百度学术
A modified artificial bee colony algorithm
原文链接
谷歌学术
必应学术
百度学术
Interior point methods in DEA to determine non-zero multiplier weights
原文链接
谷歌学术
必应学术
百度学术
A heuristic algorithm based on Lagrangian relaxation for the closest string problem
原文链接
谷歌学术
必应学术
百度学术
A Lagrangian approach for minimum cost single round robin tournaments
原文链接
谷歌学术
必应学术
百度学术
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
原文链接
谷歌学术
必应学术
百度学术
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
原文链接
谷歌学术
必应学术
百度学术
Improved LP-based algorithms for the closest string problem
原文链接
谷歌学术
必应学术
百度学术