咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 195 篇 integer programm...
  • 88 篇 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

语言

  • 734 篇 英文
  • 5 篇 其他
  • 4 篇 中文
检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"
743 条 记 录,以下是201-210 订阅
排序:
ABC optimization aided Joint User and throughput Maximization in underlay D2D communication  13
ABC optimization aided Joint User and Throughput Maximizatio...
收藏 引用
13th IEEE international conference on Advanced Networks and Telecommunication Systems (IEEE ANTS)
作者: Khanolkar, Shailesh Sharma, Nitin Birla Inst Technol & Sci Dept Elect & Elect Engn Pilani Goa India
Device to Device (D2D) communication represents a paradigm shift in the quest for realizing the twin objectives of maximization of system throughput and spectral efficiency for 5G networks. D2D communication allows de... 详细信息
来源: 评论
A Computational Comparison of optimization Methods for the Golomb Ruler Problem  16th
A Computational Comparison of Optimization Methods for the G...
收藏 引用
16th international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)
作者: Kocuk, Burak van Hoeve, Willem-Jan Sabanci Univ TR-34956 Istanbul Turkey Carnegie Mellon Univ Pittsburgh PA 15213 USA
the Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of... 详细信息
来源: 评论
integer programming and Incidence Treedepth  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (IPCO)
作者: Eiben, Eduard Ganian, Robert Knop, Dusan Ordyniak, Sebastian Pilipczuk, Michal Wrochna, Marcin Univ Bergen Dept Informat Bergen Norway Tech Univ Wien Algorithms & Complex Grp Vienna Austria TU Berlin Fac 4 Algorithm & Computat Complex Berlin Germany Czech Tech Univ Dept Theoret Comp Sci Fac Informat Technol Prague Czech Republic Univ Sheffield Dept Comp Sci Algorithms Grp Sheffield S Yorkshire England Univ Warsaw Inst Informat Warsaw Poland Univ Oxford Oxford England
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, int... 详细信息
来源: 评论
combinatorial Learning in Traffic Management  5th
Combinatorial Learning in Traffic Management
收藏 引用
5th international conference on Machine Learning, optimization, and Data Science (LOD)
作者: Sartor, Giorgio Mannino, Carlo Bach, Lukas SINTEF Digital Oslo Norway
We describe an exact combinatorial learning approach to solve dynamic job-shop scheduling problems arising in traffic management. When a set of vehicles has to be controlled in real-time, a new schedule must be comput... 详细信息
来源: 评论
Computational Models for Cumulative Prospect theory: Application to the Knapsack Problem Under Risk  1
收藏 引用
13th international conference on Scalable Uncertainty Management (SUM)
作者: Martin, Hugo Perny, Patrice Sorbonne Univ CNRS LIP6 F-75005 Paris France
Cumulative Prospect theory (CPT) is a well known model introduced by Kahneman and Tversky in the context of decision making under risk to overcome some descriptive limitations of Expected Utility. In particular CPT ma... 详细信息
来源: 评论
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup theory and Equivariant Decomposition theorem  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (IPCO)
作者: Hildebrand, Robert Koppe, Matthias Zhou, Yuan Virginia Tech Grado Dept Ind & Syst Engn Blacksburg VA USA Univ Calif Davis Dept Math Davis CA 95616 USA Univ Kentucky Dept Math Lexington KY 40506 USA
the non-extreme minimal valid functions for the Gomory-Johnson infinite group problem are those that admit effective perturbations. For a class of piecewise linear functions for the 1-row problem we give a precise des... 详细信息
来源: 评论
A stochastic dual dynamic integer programming for the uncapacitated lot-sizing problem with uncertain demand and costs  29
A stochastic dual dynamic integer programming for the uncapa...
收藏 引用
29th international conference on Automated Planning and Scheduling, ICAPS 2019
作者: Quezada, Franco Gicquel, Céline Kedad-Sidhoum, Safia Sorbonne Université LIP6 4 Place Jussieu Paris75005 France Université Paris-Saclay LRI Rue Noetzlin Gif-sur-Yvette91190 France CNAM CEDRIC 292 Rue Saint-Martin Paris75003 France
We study the uncapacitated lot-sizing problem with uncertain demand and costs. We consider a multi-stage decision process and rely on a scenario tree to represent the uncertainty. We propose to solve this stochastic c... 详细信息
来源: 评论
Systems Modeling and optimization of Container Ship Berthing with Various Enterprise Risks  13
Systems Modeling and Optimization of Container Ship Berthing...
收藏 引用
13th Annual IEEE international Systems conference (SysCon)
作者: thorisson, Heimir Pennetti, Cody A. Andrews, Daniel J. Hendrickson, Daniel C. Polmateer, thomas L. Lambert, James H. Univ Virginia Dept Engn Syst & Environm Charlottesville VA 22903 USA Virginia Port Author Norfolk VA USA
Scheduling for logistics systems, such as assigning of container vessels to marine port terminals, is subject to uncertainty in product arrival times, resource availability, efficiency of available resources, product ... 详细信息
来源: 评论
A Generic Exact Solver for Vehicle Routing and Related Problems  20th
A Generic Exact Solver for Vehicle Routing and Related Probl...
收藏 引用
20th international conference on integer programming and combinatorial optimization (IPCO)
作者: Pessoa, Artur Sadykov, Ruslan Uchoa, Eduardo Vanderbeck, Francois Inria Bordeaux Sud Ouest Talence France Univ Bordeaux Talence France Univ Fed Fluminense Niteroi RJ Brazil
Major advances were recently obtained in the exact solution of Vehicle Routing Problems (VRPs). Sophisticated Branch-Cut-and-Price (BCP) algorithms for some of the most classical VRP variants now solve many instances ... 详细信息
来源: 评论
A Generalized and Dynamic Framework for Solar-Powered Roadside Transmitter Unit Planning  13
A Generalized and Dynamic Framework for Solar-Powered Roadsi...
收藏 引用
13th Annual IEEE international Systems conference (SysCon)
作者: Lucic, Michael C. Ghazzai, Hakim Massoud, Yehia Stevens Inst Technol Sch Syst & Enterprises Hoboken NJ 07030 USA
Roadside Unit (RSU) planning is a key step for the development of a robust Intelligent Transportation System (ITS). Many factors, including traffic flow variation, energy consumption, and budgetary constraints, all af... 详细信息
来源: 评论