咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
Extended Formulations in Mixed-integer Convex programming  1
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Lubin, Miles Yamangil, Emre Bent, Russell Vielma, Juan Pablo MIT 77 Massachusetts Ave Cambridge MA 02139 USA Los Alamos Natl Lab Los Alamos NM USA
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iteratio... 详细信息
来源: 评论
Intersection Cuts for Bilevel optimization  1
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Fischetti, Matteo Ljubic, Ivana Monaci, Michele Sinnl, Markus Univ Padua DEI Padua Italy ESSEC Business Sch Paris Cergy Pontoise France Univ Vienna ISOR Vienna Austria
the exact solution of bilevel optimization problems is a very challenging task that received more and more attention in recent years, as witnessed by the flourishing recent literature on this topic. In this paper we p... 详细信息
来源: 评论
Towards the price of leasing online
收藏 引用
JOURNAL OF combinatorial optimization 2016年 第4期32卷 1197-1216页
作者: Abshoff, Sebastian Kling, Peter Markarian, Christine Heide, Friedhelm Meyer Auf Der Pietrzyk, Peter Univ Paderborn Dept Comp Sci Furstenallee 11 D-33102 Paderborn Germany Univ Paderborn Heinz Nixdorf Inst Furstenallee 11 D-33102 Paderborn Germany Simon Fraser Univ Sch Comp Sci 8888 Univ Dr Burnaby BC V5A 1S6 Canada
We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods... 详细信息
来源: 评论
Maximizing Monotone Submodular Functions over the integer Lattice  18th
Maximizing Monotone Submodular Functions over the Integer La...
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Soma, Tasuku Yoshida, Yuichi Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan Natl Inst Informat & Preferred Infrastruct Inc Tokyo Japan
the problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the int... 详细信息
来源: 评论
Semidefinite and Linear programming Integrality Gaps for Scheduling Identical Machines  1
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Kurpisz, Adam Mastrolilli, Monaldo Mathieu, Claire Moemke, Tobias Verdugo, Victor Wiese, Andreas Dalle Molle Inst Artificial Intelligence Res Manno Switzerland Ecole Normale Super CNRS UMR 8548 Dept Comp Sci Paris France Univ Saarland Dept Comp Sci Saarbrucken Germany Univ Chile Dept Ind Engn Santiago Chile Max Planck Inst Informat Saarbrucken Germany
Sherali-Adams [25] and Lovasz-Schrijver [21] developed systematic procedures to strengthen a relaxation known as lift-and-project methods. they have been proven to be a strong tool for developing approximation algorit... 详细信息
来源: 评论
Valid Inequalities for Separable Concave Constraints with Indicator Variables  18th
Valid Inequalities for Separable Concave Constraints with In...
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Lim, Cong Han Linderoth, Jeff Luedtke, James Univ Wisconsin Dept Comp Sci 1210 W Dayton St Madison WI 53706 USA Univ Wisconsin Dept Ind & Syst Engn Madison WI USA
We study valid inequalities for a set relevant for optimization models that have both binary indicator variables, which indicate positivity of associated continuous variables, and separable concave constraints. Such m... 详细信息
来源: 评论
integer programming and combinatorial optimization - 16th international conference, ipco 2013, Proceedings
收藏 引用
16th conference on integer programming and combinatorial optimization, ipco 2013
the proceedings contain 33 papers. the topics discussed include: on the structure of reduced kernel lattice bases;all-or-nothing generalized assignment with application to scheduling advertising campaigns;intersection...
来源: 评论
the triangle splitting method for biobjective mixed integer programming
收藏 引用
17th international conference on integer programming and combinatorial optimization, ipco 2014
作者: Boland, Natashia Charkhgard, Hadi Savelsbergh, Martin School of Mathematical and Physical Sciences University of Newcastle NSW 2308 Australia
We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. the algorithm is relatively easy to implement and conver... 详细信息
来源: 评论
Lower bounds on the sizes of integer programs without additional variables
收藏 引用
17th international conference on integer programming and combinatorial optimization, ipco 2014
作者: Kaibel, Volker Weltge, Stefan Otto-von-Guericke-Universität Magdeburg Germany
For a given set X ⊆ Z d of integer points, we investigate the smallest number of facets of any polyhedron whose set of integer points is conv(X) ∩ Z d . this quantity, which we call the relaxation complexity of X, co... 详细信息
来源: 评论
Simple extensions of polytopes
收藏 引用
17th international conference on integer programming and combinatorial optimization, ipco 2014
作者: Kaibel, Volker Walter, Matthias Otto-von-Guericke Universität Magdeburg Germany
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a... 详细信息
来源: 评论