咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 729 篇 电子文献
  • 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...
  • 8 篇 genetic algorith...
  • 8 篇 cutting planes
  • 8 篇 semidefinite pro...

机构

  • 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

语言

  • 722 篇 英文
  • 5 篇 其他
  • 4 篇 中文
检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"
731 条 记 录,以下是251-260 订阅
排序:
A variable neighborhood search algorithm for the long-term preventive maintenance scheduling problem  20
A variable neighborhood search algorithm for the long-term p...
收藏 引用
20th international conference on Enterprise Information Systems, ICEIS 2018
作者: Aquino, Roberto D. Chagas, Jonatas B.C. Souza, Marcone J.F. Instituto de Ciências Exatas e Biológicas Departamento de Computação Universidade Federal de Ouro Preto Ouro Preto Brazil
In this work we propose a Variable Neighborhood Search (VNS) approach for the long-term maintenance programming of an iron ore processing plant of a company in Brazil. the problem is a complex maintenance programming ... 详细信息
来源: 评论
Exact solution of one production scheduling problem  7th
Exact solution of one production scheduling problem
收藏 引用
7th international conference on optimization Problems and their Applications, OPTA 2018
作者: Borisovsky, Pavel Sobolev Institute of Mathematics Omsk Russia
In this study, one variant of multi-product scheduling problem is considered. the problem asks to find the optimal selection of a set of tasks to produce a given number of products in required amounts, to allocate the... 详细信息
来源: 评论
5th international Symposium on combinatorial optimization, ISCO 2018
5th International Symposium on Combinatorial Optimization, I...
收藏 引用
5th international Symposium on combinatorial optimization, ISCO 2018
the proceedings contain 35 papers. the special focus in this conference is on combinatorial optimization. the topics include: Online firefighting on trees;a multigraph formulation for the generalized minimum spanning ...
来源: 评论
On vertices of the simple boolean quadric polytope extension  7th
On vertices of the simple boolean quadric polytope extension
收藏 引用
7th international conference on optimization Problems and their Applications, OPTA 2018
作者: Nikolaev, Andrei V. Department of Discrete Analysis P.G. Demidov Yaroslavl State University Yaroslavl Russia
Following the seminal work of Padberg on the Boolean quadric polytope BQP and its LP relaxation BQPLP, we consider a natural extension: the polytopes SATP and SATPLP, with BQPLP being a projection of SATPLP face (and ... 详细信息
来源: 评论
Operations research and voting theory  6th
Operations research and voting theory
收藏 引用
6th international conference on Operations Research and Enterprise Systems, ICORES 2017
作者: Hudry, Olivier Télécom ParisTech 46 rue Barrault Paris Cedex 1375634 France
One main concern of voting theory is to determine a procedure for choosing a winner from among a set of candidates, based on the preferences of the voters or, more ambitiously, for ranking all the candidates or a part... 详细信息
来源: 评论
Integrality Gaps of integer Knapsack Problems  1
收藏 引用
19th international conference on integer programming and combinatorial optimization (IPCO)
作者: Aliev, Iskander Henk, Martin Oertel, Timm Cardiff Univ Cardiff S Glam Wales TU Berlin Berlin Germany
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastic... 详细信息
来源: 评论
Enumeration of integer Points in Projections of Unbounded Polyhedra  19th
Enumeration of Integer Points in Projections of Unbounded Po...
收藏 引用
19th international conference on integer programming and combinatorial optimization (IPCO)
作者: Nguyen, Danny Pak, Igor Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA
We extend the Barvinok-Woods algorithm for enumeration of integer points in projections of polytopes to unbounded polyhedra. To achieve this, we employ a new structural result on projections of semilinear subsets of t... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Targeted End-to-End Knowledge Graph Decomposition  1
收藏 引用
28th international conference on Inductive Logic programming (ILP)
作者: Skrlj, Blaz Kralj, Jan Lavrac, Nada Jozef Stefan Int Postgrad Sch Jamova 39 Ljubljana 1000 Slovenia Jozef Stefan Inst Jamova 39 Ljubljana 1000 Slovenia Univ Nova Gorica Vipavska 13 Nova Gorica 5000 Slovenia
Knowledge graphs are networks with annotated nodes and edges, representing different relations between the network nodes. Learning from such graphs is becoming increasingly important as numerous real-life systems can ... 详细信息
来源: 评论
A decentralized control strategy for energy retrofit planning of large-scale street lighting systems using dynamic programming  13
A decentralized control strategy for energy retrofit plannin...
收藏 引用
13th IEEE conference on Automation Science and Engineering (IEEE CASE)
作者: Carli, Raffaele Dotoli, Mariagrazia Polytech Bari Dept Elect & Informat Engn I-70125 Bari Italy
this paper addresses the energy management of large-scale urban street lighting systems. We propose a multi-stage decision-making procedure that supports the energy manager in determining the optimal energy retrofit p... 详细信息
来源: 评论