咨询与建议

限定检索结果

文献类型

  • 703 篇 会议
  • 21 篇 期刊文献
  • 17 册 图书

馆藏范围

  • 739 篇 电子文献
  • 2 种 纸本馆藏

日期分布

学科分类号

  • 537 篇 工学
    • 458 篇 计算机科学与技术...
    • 122 篇 软件工程
    • 84 篇 电气工程
    • 44 篇 信息与通信工程
    • 39 篇 控制科学与工程
    • 13 篇 机械工程
    • 9 篇 生物工程
    • 8 篇 电子科学与技术(可...
    • 8 篇 化学工程与技术
    • 8 篇 交通运输工程
    • 6 篇 环境科学与工程(可...
    • 5 篇 仪器科学与技术
    • 5 篇 冶金工程
    • 5 篇 安全科学与工程
    • 4 篇 光学工程
    • 4 篇 动力工程及工程热...
    • 4 篇 水利工程
    • 4 篇 石油与天然气工程
  • 339 篇 理学
    • 320 篇 数学
    • 43 篇 系统科学
    • 14 篇 生物学
    • 12 篇 物理学
    • 11 篇 统计学(可授理学、...
    • 4 篇 化学
  • 164 篇 管理学
    • 157 篇 管理科学与工程(可...
    • 44 篇 工商管理
  • 18 篇 经济学
    • 16 篇 应用经济学
  • 6 篇 医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 临床医学
  • 4 篇 法学
    • 4 篇 社会学
  • 2 篇 教育学
  • 2 篇 文学
  • 2 篇 农学

主题

  • 195 篇 integer programm...
  • 87 篇 combinatorial op...
  • 61 篇 optimization
  • 59 篇 linear programmi...
  • 23 篇 integer linear p...
  • 16 篇 mixed integer pr...
  • 14 篇 approximation al...
  • 14 篇 dynamic programm...
  • 13 篇 mixed-integer pr...
  • 13 篇 combinatorial ma...
  • 12 篇 mixed integer li...
  • 12 篇 scheduling
  • 11 篇 computational mo...
  • 11 篇 constraint progr...
  • 10 篇 mixed-integer li...
  • 10 篇 mathematical pro...
  • 10 篇 mathematical mod...
  • 10 篇 algorithm analys...
  • 9 篇 discrete mathema...
  • 9 篇 artificial intel...

机构

  • 8 篇 carnegie mellon ...
  • 6 篇 georgia inst tec...
  • 5 篇 department of co...
  • 4 篇 univ bologna dei...
  • 4 篇 ibm tj watson re...
  • 4 篇 max planck inst ...
  • 4 篇 mit cambridge ma...
  • 4 篇 carnegie mellon ...
  • 4 篇 department of co...
  • 3 篇 mit alfred p slo...
  • 3 篇 univ florida ind...
  • 3 篇 zuse inst berlin...
  • 3 篇 school of indust...
  • 3 篇 univ wisconsin d...
  • 3 篇 univ padua dipar...
  • 3 篇 brown univ dept ...
  • 3 篇 school of indust...
  • 3 篇 univ pittsburgh ...
  • 3 篇 georgia inst tec...
  • 3 篇 mit 77 massachus...

作者

  • 8 篇 nemhauser george...
  • 7 篇 lodi andrea
  • 7 篇 conforti michele
  • 6 篇 weismantel rober...
  • 6 篇 basu amitabh
  • 5 篇 rousseau louis-m...
  • 5 篇 woeginger gerhar...
  • 5 篇 dilkina bistra
  • 5 篇 van hoeve willem...
  • 5 篇 linderoth jeff
  • 5 篇 vielma juan pabl...
  • 5 篇 balas egon
  • 5 篇 dey santanu s.
  • 5 篇 fischetti matteo
  • 4 篇 munoz gonzalo
  • 4 篇 bienstock daniel
  • 4 篇 cornuéjols gérar...
  • 4 篇 fukasawa ricardo
  • 4 篇 raidl guenther r...
  • 4 篇 dash sanjeeb

语言

  • 732 篇 英文
  • 5 篇 其他
  • 4 篇 中文
检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"
741 条 记 录,以下是701-710 订阅
排序:
Performance Comparison of Unbounded Knapsack Problem Formulations  7
Performance Comparison of Unbounded Knapsack Problem Formula...
收藏 引用
7th international conference on Computational Linguistics and Intelligent Systems. Volume III: Intelligent Systems Workshop, CoLInS 2023
作者: Pichugina, Oksana Matsiy, Olha Skob, Yuriy University of Toronto 27 King's College Circle TorontoM5S 1A1 Canada National Aerospace University "Kharkiv Aviation Institute" 17 Chkalova Street Kharkiv61070 Ukraine V. N. Karazin Kharkiv National University 4 Svobody Sq. Kharkiv61022 Ukraine
this study investigates various linear discrete formulations of the unbounded knapsack problem, including binary and bounded forms. Two variations of binary knapsack problem reformulations are examined, each with dist... 详细信息
来源: 评论
An improved ACO algorithm for the bin packing problem with conflicts based on graph coloring model
An improved ACO algorithm for the bin packing problem with c...
收藏 引用
international conference on Management Science and Engineering (ICMSE)
作者: Ye Yuan Yi-jun Li Yan-qing Wang School of Management Harbin Institute of Technology Harbin Heilongjiang CN
Bin packing problem with conflicts(BPPC) is a complex combinatorial optimization problem originated from logistics, whose objective is packing all the items with the least number of bins and satisfying the conflict co... 详细信息
来源: 评论
Optimal Flow User Connectivity through Switches to Destiny Nodes in a Software-Defined Network  26
Optimal Flow User Connectivity Through Switches to Destiny N...
收藏 引用
2024 IEEE international conference on Automation/26th Congress of the Chilean Association of Automatic Control, ICA-ACCA 2024
作者: Viveros, Andŕes Adasme, Pablo Cordero, Sergio Juan, Enrique San Universidad de Santiago de Chile Chile Department of Electrical Engineering Santiago Chile
this article examines the management of user traffic to the network access point and within the network, from the user's access point to the destination server containing the required information. this study is co... 详细信息
来源: 评论
Multiobjective optimization for forward and Reverse Logistics Network Design in Rural Areas
Multiobjective Optimization for forward and Reverse Logistic...
收藏 引用
IEEE international conference on e-Business Engineering (ICEBE)
作者: Yufeng Zhuang Hang Zhao Chi Zhang School of Automation Beijing University of Posts and Telecommunications Beijing China
Nowadays, we're all familiar with the speed of e-commerce development, but we have to admit that logistics industry in rural areas is still in its infancy. As deficient rural logistics network has restricted the r... 详细信息
来源: 评论
Identification methods of critical combination of vulnerable links in transportation networks  8th
Identification methods of critical combination of vulnerable...
收藏 引用
8th international conference on Green Intelligent Transportation Systems and Safety, 2017
作者: Li, Lin Ma, Jie Li, Dawei Branch of Intelligent Equipment and Information Engineering ChangZhou Vocational Institute of Engineering ChangZhouJiangsu213164 China School of Transportation Southeast University Nanjing210096 China
this chapter presents two global optimization approaches for identifying the most critical combination of vulnerable links in a transportation network. the first approach is formulated with a bi-level framework. It ca... 详细信息
来源: 评论
A new algorithm for dynamic scheduling with partially substitutability constrained resource on critical chain  8
收藏 引用
8th international conference on Management Science and Engineering Management, ICMSEM 2014
作者: Yang, Qin Wang, Yushi Wu, S. Wang, Wenke Wang, Tingting Business School Sichuan Normal University Chengdu610064 China
A dynamic scheduling for the constrained resource with partially substitutability based on the critical chain can not only improve the work efficiency of the system, but also achieve the replacement of resources and r... 详细信息
来源: 评论
Resource provisioning for IoT application services in smart cities
Resource provisioning for IoT application services in smart ...
收藏 引用
international conference on Network and Service Management
作者: José Santos Tim Wauters Bruno Volckaert Filip De Turck Department of Information Technology IDLab Gent Belgium
In the last years, traffic over wireless networks has been increasing exponentially, due to the impact of Internet of things (IoT) and Smart Cities. Current networks must adapt to and cope with the specific requiremen... 详细信息
来源: 评论
Genetic algorithms for the multiple container packing problem
Genetic algorithms for the multiple container packing proble...
收藏 引用
5th international conference on Parallel Problem Solving from Nature, PPSN 1998
作者: Raidl, Günther R. Kodydek, Gabriele Department of Computer Graphics Vienna University of Technology Karlsplatz 13/1861 1040 Vienna Austria
this paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising similarities to the Knapsack Problem and... 详细信息
来源: 评论
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering
On the Use of Equivalence Classes for Optimal and Sub-Optima...
收藏 引用
IEEE international conference on Automation Science and Engineering (CASE)
作者: Sabino Roselli Fredrik Hagebring Sarmad Riazi Martin Fabian Knut Åkesson Department of Electrical Engineering Chalmers University of Technology Göteborg Sweden
Bin covering is an important optimization problem in many industrial fields, such as packaging, recycling, and food processing. the problem concerns a set of items, each with its own value, that are to be collected in... 详细信息
来源: 评论
optimization of Saleman Travelling Problem Using Genetic Algorithm with Combination of Order and Random Crossover
Optimization of Saleman Travelling Problem Using Genetic Alg...
收藏 引用
IEEE international conference on Control System, Computing and Engineering (ICCSCE)
作者: Muhammad Firdaus Shafie Fadzil Ahmad Muhammad Khusairi Osman Ahmad Puad Ismail Khairul Azman Ahmad Saiful Zaimy Yahaya Mohaiyedin Idris Anwar Hassan Ibrahim School of Electrical Engineering College of Engineering University Teknologi Mara Cawangan Pulau Pinang Permatang Pauh Pulau Pinang Malaysia Department of Electrical Engineering College of Engineering Qassim University Buraydah Saudi Arabia
Traveling salesman problem (TSP) is a problem of determining the shortest path for a salesman to take to visit all cities. Although a small number of cities is easy to solve, as the number of cities increases, it’s n...
来源: 评论