咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是181-190 订阅
排序:
A robust optimization approach to supply chain management
收藏 引用
10th international integer programming and combinatorial optimization conference
作者: Bertsimas, D thiele, A MIT Cambridge MA 02139 USA
We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. the attractive features of the proposed appro... 详细信息
来源: 评论
A multistart local search heuristic for knapsack problem
A multistart local search heuristic for knapsack problem
收藏 引用
19th international conference on Industrial Engineering and Engineering Management: Assistive Technology of Industrial Engineering
作者: Lin, Geng Department of Mathematics Minjiang University Fuzhou China
Knapsack problem is one of classical combinatorial optimization problems, and has a lot of applications. It is known to be NP-hard. In this paper we propose a multistart local search heuristic for solving the knapsack... 详细信息
来源: 评论
Answer set programming via mixed integer programming
Answer set programming via mixed integer programming
收藏 引用
13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012
作者: Liu, Guohua Janhunen, Tomi Niemelä, Ilkka Aalto University School of Science Department of Information and Computer Science Finland
Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with ... 详细信息
来源: 评论
optimization Methods for the Partner Units Problem
Optimization Methods for the Partner Units Problem
收藏 引用
8th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems (CPAIOR)
作者: Aschinger, Markus Drescher, Conrad Friedrich, Gerhard Gottlob, Georg Jeavons, Peter Ryabokon, Anna thorstensen, Evgenij Univ Oxford Comp Lab Oxford OX1 2JD England Alpen Adria Univ Klagenfurt Inst Angewandte Informat Klagenfurt Austria
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in industry. Unfortunately, it can be shown t... 详细信息
来源: 评论
Lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack  25th
Lower Bounds on the Complexity of Mixed-Integer Programs for...
收藏 引用
25th international conference on integer programming and combinatorial optimization (IPCO)
作者: Schade, Jamico Sinha, Makrand Weltge, Stefan Tech Univ Munich Munich Germany Univ Illinois Champaign IL 61820 USA
Standard mixed-integer programming formulations for the stable set problem on n-node graphs require n integer variables. We prove that this is almost optimal: We give a family of n-node graphs for which every polynomi... 详细信息
来源: 评论
Improving strong branching by propagation
Improving strong branching by propagation
收藏 引用
10th international conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2013
作者: Gamrath, Gerald Zuse Institute Berlin Takustr. 7 14195 Berlin Germany
Strong branching is an important component of most variable selection rules in branch-and-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary... 详细信息
来源: 评论
Constrained Discrete Black-Box optimization using Mixed-integer programming  39
Constrained Discrete Black-Box Optimization using Mixed-Inte...
收藏 引用
39th international conference on Machine Learning (ICML)
作者: Papalexopoulos, theodore P. Tjandraatmadja, Christian Anderson, Ross Vielma, Juan Pablo Belanger, David MIT Operat Res Ctr 77 Massachusetts Ave Cambridge MA 02139 USA Google Res Cambridge MA 02138 USA
Discrete black-box optimization problems are challenging for model-based optimization (MBO) algorithms, such as Bayesian optimization, due to the size of the search space and the need to satisfy combinatorial constrai...
来源: 评论
New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Balas, Egon Bonami, Pierre Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA IBM Corp T J Watson Res Yorktown Hts NY USA
We discuss an open source implementation and preliminary computational testing of three variants of the Balas-Perregaard procedure for generating lift-and-project cuts from the original simplex tableau, two of which a... 详细信息
来源: 评论
A Relax-and-Cut Framework for Gomory's Mixed-integer Cuts
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts
收藏 引用
7th international conference Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Fischetti, Matteo Salvagnin, Domenico Univ Padua DEI I-35100 Padua Italy Univ Padua DMPA Padua Italy
Gomory's Mixed-integer Cuts (GMICs) are widely used in modern branch-and-cut codes for the solution of Mixed-integer Programs. Typically, GMICs are iteratively generated from the optimal basis of the current Linea... 详细信息
来源: 评论
Balancing Nursing Workload by Constraint programming  13th
Balancing Nursing Workload by Constraint Programming
收藏 引用
13th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming (CPAIOR)
作者: Pesant, Gilles Ecole Polytech Montreal PQ Canada Univ Montreal CIRRELT Montreal PQ Canada
Nursing workload in hospitals has an impact on the quality of care and on job satisfaction. Understandably there has been much recent research on improving the staffing and nurse-patient assignment decisions in increa... 详细信息
来源: 评论