咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 537 篇 工学
    • 458 篇 计算机科学与技术...
    • 122 篇 软件工程
    • 84 篇 电气工程
    • 44 篇 信息与通信工程
    • 39 篇 控制科学与工程
    • 13 篇 机械工程
    • 9 篇 生物工程
    • 8 篇 电子科学与技术(可...
    • 8 篇 化学工程与技术
    • 8 篇 交通运输工程
    • 6 篇 环境科学与工程(可...
    • 5 篇 仪器科学与技术
    • 5 篇 冶金工程
    • 5 篇 安全科学与工程
    • 4 篇 光学工程
    • 4 篇 动力工程及工程热...
    • 4 篇 水利工程
    • 4 篇 石油与天然气工程
  • 340 篇 理学
    • 321 篇 数学
    • 43 篇 系统科学
    • 14 篇 生物学
    • 12 篇 物理学
    • 11 篇 统计学(可授理学、...
    • 4 篇 化学
  • 165 篇 管理学
    • 158 篇 管理科学与工程(可...
    • 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 条 记 录,以下是671-680 订阅
Off-line algorithms for Routing, Modulation Level, and Spectrum Assignment in elastic optical networks
Off-line algorithms for Routing, Modulation Level, and Spect...
收藏 引用
international conference on Transparent Optical Networks
作者: Miroslaw Klinkowski Krzysztof Walkowiak Marek Jaworski Department of Transmission and Optical Technologies National Institute of Telecommunications Warszawa Poland Department of System and Computer Networks Wroclaw University of Technology Wroclaw Poland
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexib... 详细信息
来源: 评论
Answer Set programming: Boolean Constraint Solving for Knowledge Representation and Reasoning
Answer Set Programming: Boolean Constraint Solving for Knowl...
收藏 引用
19th Annual international conference on Principles and Practice of Constraint programming (CP)
作者: Schaub, Torsten Simon Fraser Univ Burnaby BC V5A 1S6 Canada
Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited fo... 详细信息
来源: 评论
New Valid Inequalities and combinatorial Benders' Cuts Algorithm for the Quayside Operation optimization Problem Without Big-M Coefficient
New Valid Inequalities and Combinatorial Benders' Cuts Algor...
收藏 引用
international conference on Services Systems and Services Management, ICSSSM
作者: Ming Liu Bian Liang Chengbin Chu Feng Chu School of Economics & Management Tongji University Shanghai China Laboratoire Génie Industriel Centrale Supélec Université Paris-Saclay Châtenay-Malabry France Laboratory IBISC University of Evry-Val d'Essonne Evry France
this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, with the objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formul... 详细信息
来源: 评论
Multiple traveling salesmen in asymmetric metrics
Multiple traveling salesmen in asymmetric metrics
收藏 引用
16th international Workshop on Approximation Algorithms for combinatorial optimization Problems, APPROX 2013 and the 17th international Workshop on Randomization and Computation, RANDOM 2013
作者: Friggstad, Zachary University of Waterloo Department of Combinatorics and Optimization Waterloo ON Canada
We consider some generalizations of the Asymmetric Traveling Salesman Path Problem. In these variants, we have multiple salesmen that we are to move around a metric and the goal is to have each node visited by at leas... 详细信息
来源: 评论
Sustainable Biofuel Solution for Industrial and Commercial Sectors: A Stochastic Green Supply Chain Design Approach  8th
Sustainable Biofuel Solution for Industrial and Commercial S...
收藏 引用
8th international conference on Advances in Energy Research , ICAER 2022
作者: Gumte, Kapil Indian Institute of Management Jammu Jammu India
To solve the two major challenges in the energy sector i.e. demand supply ratio and to achieve clean energy, biomass and biofuels provide the best suitable options in agriculture based developing nations like India. T... 详细信息
来源: 评论
Discrepancy-based additive bounding for the alldifferent constraint
收藏 引用
9th international conference on Principles and Practice of Constraint programming, CP 2003
作者: Lodi, Andrea Milano, Michela Rousseau, Louis-Martin D.E.I.S Università di Bologna Viale Risorgimento 2 Bologna40136 Italy Centre for Research on Transportation Université de Montréal CP 6128 Succ Centre-Ville MontréalH3C 3J7 Canada
In this paper we show how to exploit in Constraint programming (CP) a well-known integer programming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search ... 详细信息
来源: 评论
Transmission capacity margin assessment in power systems with uncertain wind integration
Transmission capacity margin assessment in power systems wit...
收藏 引用
IEEE international conference on Automation Science and Engineering (CASE)
作者: Yafei Yang Xuejiao Lei Qiaozhu Zhai Jiang Wu Xiaohong Guan Systems Engineering Institute MOE KLINNS Lab of Xi'an Jiaotong University China State Grid Energy Research Institute Beijing China Center for Intelligent and Networked Systems Tsinghua University Beijing China
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacit... 详细信息
来源: 评论
On the effectiveness of using sentence compression models for query-focused multi-document summarization
On the effectiveness of using sentence compression models fo...
收藏 引用
24th international conference on Computational Linguistics, COLING 2012
作者: Chali, Yllias Hasan, Sadid A. University of Lethbridge Lethbridge AB Canada
this paper applies sentence compression models for the task of query-focused multi-document summarization in order to investigate if sentence compression improves the overall summarization performance. Both compressio... 详细信息
来源: 评论
A class of linear programs solvable by coordinate-wise minimization  1
收藏 引用
14th international conference on Learning and Intelligent optimization, LION 2020
作者: Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable and/or constrained) convex problems it may not find global minima. We present a clas... 详细信息
来源: 评论
A parallel Branch and Bound algorithm for solving large scale integer multiobjective problems
A parallel Branch and Bound algorithm for solving large scal...
收藏 引用
the international conference on Informatics and Systems (INFOS)
作者: Mahmoud M. Ismail Waiel F. Abd El-Wahed Osama abd el-raoof Faculty of Computers and Information Systems Operations Research Department Zagazig Egypt Operations Research Decision Support Faculty of Computers and Information Menoufia University Egypt
the multi-objective integer programming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. th... 详细信息
来源: 评论