咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
Deciding Emptiness of the Gomory-Chvatal Closure is NP-Complete, Even for a Rational Polyhedron Containing No integer Point  18th
Deciding Emptiness of the Gomory-Chvatal Closure is NP-Compl...
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Cornuejols, Gerard Li, Yanjun Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA Purdue Univ Krannert Sch Management W Lafayette IN 47906 USA
Gomory-Chvatal cuts are prominent in integer programming. the Gomory-Chvatal closure of a polyhedron is the intersection of all half spaces defined by its Gomory-Chvatal cuts. In this paper, we show that it is NP-comp... 详细信息
来源: 评论
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Bendotti, Pascale Fouilhoux, Pierre Rottner, Cecile Sorbonne Univ CNRS 7606 LIP6 Paris France EDF R&D Palaiseau France
We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. We propose a framework to build (sub-)symmetry-breaking inequalitie... 详细信息
来源: 评论
On the Congruency-Constrained Matroid Base  25th
On the Congruency-Constrained Matroid Base
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Liu, Siyue Xu, Chao Univ Elect Sci & Technol China Chengdu Peoples R China Carnegie Mellon Univ Pittsburgh PA 15213 USA
Consider a matroid where all elements are labeled with an element in Z. We are interested in finding a base where the sum of the labels is congruent to g (mod m). We show that this problem can be solved in (O) over ti... 详细信息
来源: 评论
Sparsity and Integrality Gap Transference Bounds for integer Programs  25th
Sparsity and Integrality Gap Transference Bounds for Integer...
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Aliev, Iskander Celaya, Marcel Henk, Martin Cardiff Univ Cardiff Wales Tech Univ Berlin Berlin Germany
We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs ... 详细信息
来源: 评论
A Lower Bound for the Max Entropy Algorithm for TSP  25th
A Lower Bound for the Max Entropy Algorithm for TSP
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Jin, Billy Klein, Nathan Williamson, David P. Cornell Univ Ithaca NY 14850 USA Inst Adv Study Olden Lane Princeton NJ 08540 USA
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to 4/3. For 40 years, the best kno... 详细信息
来源: 评论
Persistency of Linear programming Relaxations for the Stable Set Problem  21st
Persistency of Linear Programming Relaxations for the Stable...
收藏 引用
21st international conference on integer programming and combinatorial optimization (ipco)
作者: Rodriguez-Heck, Elisabeth Stickler, Karl Walter, Matthias Weltge, Stefan Rhein Westfal TH Aachen Lehrstuhl Operat Res Aachen Germany Univ Twente Dept Appl Math Enschede Netherlands Tech Univ Munich Dept Math Munich Germany
the Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that ass... 详细信息
来源: 评论
Intersection Cuts for Factorable MINLP  20th
Intersection Cuts for Factorable MINLP
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Serrano, Felipe Zuse Inst Berlin Optimizat Dept Takustr 7 D-14195 Berlin Germany
Given a factorable function f, we propose a procedure that constructs a concave underestimator of f that is tight at a given point. these underestimators can be used to generate intersection cuts. A peculiarity of the... 详细信息
来源: 评论
Linear programming Using Limited-Precision Oracles  20th
Linear Programming Using Limited-Precision Oracles
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Gleixner, Ambros Steffy, Daniel E. Konrad Zuse Zentrum Informat Tech Berlin Takustr 7 D-14195 Berlin Germany Oakland Univ Math & Stat Rochester MI 48063 USA
Linear programming is a foundational tool for many aspects of integer and combinatorial optimization. this work studies the complexity of solving linear programs exactly over the rational numbers through use of an ora... 详细信息
来源: 评论
Fast combinatorial Algorithms for Efficient Sortation  25th
Fast Combinatorial Algorithms for Efficient Sortation
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Van Dyk, Madison Klause, Kim Koenemann, Jochen Megow, Nicole Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada Univ Bremen Fac Math & Comp Sci Bremen Germany Amazon Modeling & Optimizat Seattle WA USA
Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume needs to be consolidated at intermediate ...
来源: 评论
Rescaled Coordinate Descent Methods for Linear programming  1
收藏 引用
18th international conference on integer programming and combinatorial optimization (ipco)
作者: Dadush, Daniel Vegh, Laszlo A. Zambelli, Giacomo Ctr Wiskunde & Informat Amsterdam Netherlands London Sch Econ London England
We propose two simple polynomial-time algorithms to find a positive solution to Ax = 0. Both algorithms iterate between coordinate descent steps similar to von Neumann's algorithm, and rescaling steps. In both cas... 详细信息
来源: 评论