咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是171-180 订阅
排序:
Information Complexity of Mixed-integer Convex optimization  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (IPCO)
作者: Basu, Amitabh Jiang, Hongyi Kerger, Phillip Molinaro, Marco Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD USA Cornell Univ Sch Civil & Environm Engn Ithaca NY 14853 USA Microsoft Res Redmond WA 98052 USA Pontificia Univ Catolica Rio de Janeiro Comp Sci Dept Rio de Janeiro Brazil
We investigate the information complexity of mixed-integer convex optimization under different kinds of oracles. We establish new lower bounds for the standard first-order oracle, improving upon the previous best know... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Cost-bounded binary decision diagrams for 0-1 programming
收藏 引用
4th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Hadzic, Tarik Hooker, J. N. IT Univ Copenhagen Rued Langgaards Vej 7 DK-2300 Copenhagen Denmark Carnegie Mellon Univ Pittsburgh PA 15213 USA
In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller BDDs can be used for the same analysis by empl... 详细信息
来源: 评论
Hedging uncertainty: Approximation algorithms for stochastic optimization problems
收藏 引用
10th international integer programming and combinatorial optimization conference
作者: Ravi, R Sinha, A Carnegie Mellon Univ Grad Sch Ind Adm Pittsburgh PA USA
We study the design of approximation algorithms for stochastic combinatorial optimization problems. We formulate the problems in the framework of two-stage stochastic optimization, and provide nearly tight approximati... 详细信息
来源: 评论
integer programming and Combinatoral optimization  1
收藏 引用
丛书名: Lecture Notes in Computer Science
1000年
作者: Oktay Günlük Gerhard J. Woeginger
this book constitutes the proceedings of the 15th international conference on integer programming and combinatorial optimization, IPCO 2011, held in New York, USA in June 2011. the 33 papers presented were carefully r... 详细信息
来源: 评论
Compressing Branch-and-Bound Trees  24th
Compressing Branch-and-Bound Trees
收藏 引用
24th international conference on integer programming and combinatorial optimization (IPCO)
作者: Munoz, Gonzalo Paat, Joseph Xavier, Alinson S. Univ OHiggins Inst Engn Sci Rancagua Chile Univ British Columbia Sauder Sch Business Vancouver BC Canada Argonne Natl Lab Energy Syst & Infrastruct Anal Div Lemont IL 60439 USA
A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a sma... 详细信息
来源: 评论
Cost propagation - Numerical propagation for optimization problems  1
收藏 引用
5th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Grohe, Birgit Wedelin, Dag Chalmers Dept Comp Sci & Engn SE-41296 Gothenburg Sweden
We investigate cost propagation for solving combinatorial optimization problems with finite domain variables, expressed as an additive component model. Cost propagation combines ideas from both constraint programming ... 详细信息
来源: 评论
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable integer Programs
A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fol...
收藏 引用
14th international conference integer programming and combinatorial optimization
作者: Hemmecke, Raymond Koeppe, Matthias Weismantel, Robert Tech Univ Munich D-8000 Munich Germany Univ Calif Davis CA USA ETH Zurich Switzerland
In this paper we generalize N-fold integer programs and two-stage integer programs with AT scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer program... 详细信息
来源: 评论
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... 详细信息
来源: 评论
GRIN: An implementation of gröbner bases for integer programming  4th
GRIN: An implementation of gröbner bases for integer progra...
收藏 引用
4th international conference on integer programming and combinatorial optimization, IPCO 1995
作者: Hoşten, Serkan Sturmfels, Bernd School of Operations Research and Industrial Engineering Cornell University IthacaNY14853 United States Department of Mathematics University of California BerkeleyCA94720 United States
来源: 评论