咨询与建议

限定检索结果

文献类型

  • 219 篇 会议
  • 10 册 图书
  • 7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 153 篇 工学
    • 139 篇 计算机科学与技术...
    • 22 篇 软件工程
    • 18 篇 电气工程
    • 11 篇 信息与通信工程
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
    • 1 篇 交通运输工程
    • 1 篇 农业工程
    • 1 篇 生物工程
    • 1 篇 安全科学与工程
  • 138 篇 理学
    • 137 篇 数学
    • 10 篇 系统科学
    • 3 篇 物理学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
    • 1 篇 生物学
  • 28 篇 管理学
    • 25 篇 管理科学与工程(可...
    • 14 篇 工商管理
  • 8 篇 经济学
    • 8 篇 应用经济学
    • 1 篇 理论经济学
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 66 篇 integer programm...
  • 32 篇 linear programmi...
  • 23 篇 combinatorial op...
  • 10 篇 approximation al...
  • 6 篇 semidefinite pro...
  • 5 篇 discrete mathema...
  • 5 篇 graph theory
  • 5 篇 numeric computin...
  • 5 篇 cutting planes
  • 5 篇 algorithm analys...
  • 4 篇 mixed-integer pr...
  • 4 篇 optimization
  • 4 篇 combinatorial ma...
  • 4 篇 dynamic programm...
  • 4 篇 cost functions
  • 3 篇 integer programs
  • 2 篇 assortment optim...
  • 2 篇 stable set
  • 2 篇 mixed integer no...
  • 2 篇 computational co...

机构

  • 5 篇 department of co...
  • 4 篇 department of co...
  • 3 篇 univ bologna dei...
  • 3 篇 school of indust...
  • 3 篇 mit 77 massachus...
  • 3 篇 georgia inst tec...
  • 2 篇 london sch econ ...
  • 2 篇 columbia univ gr...
  • 2 篇 cwi
  • 2 篇 rhein westfal th...
  • 2 篇 school of indust...
  • 2 篇 carnegie mellon ...
  • 2 篇 shandong normal ...
  • 2 篇 univ twente dept...
  • 2 篇 univ british col...
  • 2 篇 max planck inst ...
  • 2 篇 mit cambridge ma...
  • 2 篇 isi institute me...
  • 2 篇 univ padua dei i...
  • 2 篇 zuse inst berlin

作者

  • 7 篇 nemhauser george...
  • 5 篇 woeginger gerhar...
  • 5 篇 cornuéjols gérar...
  • 5 篇 basu amitabh
  • 4 篇 munoz gonzalo
  • 4 篇 lodi andrea
  • 4 篇 kaibel volker
  • 4 篇 dey santanu s.
  • 4 篇 fischetti matteo
  • 4 篇 guenin bertrand
  • 4 篇 paat joseph
  • 3 篇 oertel timm
  • 3 篇 li yanjun
  • 3 篇 aliev iskander
  • 3 篇 monaci michele
  • 3 篇 weltge stefan
  • 3 篇 weismantel rober...
  • 3 篇 dadush daniel
  • 3 篇 vielma juan pabl...
  • 3 篇 burkard rainer e...

语言

  • 233 篇 英文
  • 3 篇 中文
检索条件"任意字段=11th International IPCO Conference on Integer Programming and Combinatorial Optimization"
236 条 记 录,以下是31-40 订阅
排序:
integer Points in Arbitrary Convex Cones: the Case of the PSD and SOC Cones  25th
Integer Points in Arbitrary Convex Cones: The Case of the PS...
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: De Loera, Jesus A. Marsters, Brittney Xu, Luze Zhang, Shixuan Univ Calif Davis Davis CA 95616 USA Texas A&M Univ College Stn TX 77843 USA
We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral con... 详细信息
来源: 评论
A Fast combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints  24th
A Fast Combinatorial Algorithm for the Bilevel Knapsack Prob...
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Weninger, Noah Fukasawa, Ricardo Univ Waterloo Waterloo ON Canada
We consider the bilevel knapsack problem with interdiction constraints, a fundamental bilevel integer programming problem which generalizes the 0-1 knapsack problem. In this problem, there are two knapsacks and n item... 详细信息
来源: 评论
Robust Monotone Submodular Function Maximization  18th
Robust Monotone Submodular Function Maximization
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Orlin, James B. Schulz, Andreas S. Udwani, Rajan MIT 77 Massachusetts Ave Cambridge MA 02139 USA
We consider a robust formulation, introduced by Krause et al. (2008), of the classic cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results.... 详细信息
来源: 评论
Towards a Characterization of Maximal Quadratic-Free Sets  24th
Towards a Characterization of Maximal Quadratic-Free Sets
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Munoz, Gonzalo Paat, Joseph Serrano, Felipe Univ OHiggins Engn Sci Inst Rancagua Chile Univ British Columbia Sauder Sch Business Vancouver BC Canada I2DAMO GmbH Berlin Germany
In 1971, Balas introduced intersection cuts as a method for generating cutting planes in integer optimization. these cuts are derived from convex S-free sets, and inclusion-wise maximal S-free sets yield the strongest... 详细信息
来源: 评论
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations  18th
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulat...
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Kurpisz, Adam Leppaenen, Samuli Mastrolilli, Monaldo IDSIA CH-6928 Manno Switzerland
We introduce a method for proving Sum-of-Squares (SoS)/Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study ... 详细信息
来源: 评论
Strong Reductions for Extended Formulations  18th
Strong Reductions for Extended Formulations
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Braun, Gabor Pokutta, Sebastian Roy, Aurko Georgia Inst Technol ISyE Atlanta GA 30332 USA Georgia Inst Technol Coll Comp Atlanta GA 30332 USA
We generalize the reduction mechanism between linear programming problems from [1] in two ways (1) relaxing the requirement of affineness, and (2) extending to fractional optimization problems. As applications we prov... 详细信息
来源: 评论
Stochastic Online Scheduling on Unrelated Machines  1
收藏 引用
19th international conference on integer programming and combinatorial optimization (ipco)
作者: Gupta, Varun Moseley, Benjamin Uetz, Marc Xie, Qiaomin Univ Chicago Chicago IL 60637 USA Washington Univ St Louis MO USA Univ Twente Enschede Netherlands Univ Illinois Champaign IL USA
We derive the first performance guarantees for a combinatorial online algorithm that schedules stochastic, nonpreemptive jobs on unrelated machines to minimize the expectation of the total weighted completion time. Pr... 详细信息
来源: 评论
Consecutive ones and a betweenness problem in computational biology  6th
Consecutive ones and a betweenness problem in computational ...
收藏 引用
6th international conference on integer programming and combinatorial optimization (ipco VI)
作者: Christof, T Oswald, M Reinelt, G Heidelberg Univ Inst Angew Math D-69120 Heidelberg Germany
In this paper we consider a variant of the betweenness problem occurring in computational biology. We present a new polyhedral approach which incorporates the solution of consecutive ones problems and show that it sup... 详细信息
来源: 评论
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time  20th
Computing the Nucleolus of Weighted Cooperative Matching Gam...
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Konemann, Jochen Pashkovich, Kanstantsin Toth, Justin Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Ottawa Ottawa ON K1N 6N5 Canada
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathemat... 详细信息
来源: 评论
Identically Self-blocking Clutters  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Abdi, Ahmad Cornuejols, Gerard Lee, Dabeen Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from {{a}} is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Pr... 详细信息
来源: 评论