咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是111-120 订阅
排序:
Backdoor Branching
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Fischetti, Matteo Monaci, Michele Univ Padua DEI Via Gradenigo 6-A I-35131 Padua Italy
Which is the minimum number of variables that need branching for a given MIP instance? Can this information be effective in producing compact branching trees, hence improving the performance of a state-of-the-art solv... 详细信息
来源: 评论
Continuous Facility Location on Graphs  1
收藏 引用
21st international conference on integer programming and combinatorial optimization (ipco)
作者: Hartmann, Tim A. Lendl, Stefan Woeginger, Gerhard J. Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Graz Univ Technol Dept Math Graz Austria
We study a continuous facility location problem on undirected graphs where all edges have unit length and where the facilities may be positioned at the vertices as well as at interior points of the edges. the goal is ... 详细信息
来源: 评论
integer programming and Incidence Treedepth  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Eiben, Eduard Ganian, Robert Knop, Dusan Ordyniak, Sebastian Pilipczuk, Michal Wrochna, Marcin Univ Bergen Dept Informat Bergen Norway Tech Univ Wien Algorithms & Complex Grp Vienna Austria TU Berlin Fac 4 Algorithm & Computat Complex Berlin Germany Czech Tech Univ Dept Theoret Comp Sci Fac Informat Technol Prague Czech Republic Univ Sheffield Dept Comp Sci Algorithms Grp Sheffield S Yorkshire England Univ Warsaw Inst Informat Warsaw Poland Univ Oxford Oxford England
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, int... 详细信息
来源: 评论
Improving the Integrality Gap for Multiway Cut  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Berczi, Kristof Chandrasekaran, Karthekeyan Kiraly, Tamas Madan, Vivek Eotvos Lorand Univ Dept Operat Res MTA ELTE Egervary Res Grp Budapest Hungary Univ Illinois Urbana IL 61801 USA
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of k terminal nodes, and the goal is to partition the node set of the graph into k non-empty parts each con... 详细信息
来源: 评论
A Better-than-1.6-Approximation for Prize-Collecting TSP  25th
A Better-Than-1.6-Approximation for Prize-Collecting TSP
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Blauth, Jannis Klein, Nathan Nagele, Martin Univ Bonn Res Inst Discrete Math Bonn Germany Univ Bonn Hausdorff Ctr Math Bonn Germany Inst Adv Study Olden Lane Princeton NJ 08540 USA
Prize-Collecting TSP is a variant of the traveling salesperson problem where one may drop vertices from the tour at the cost of vertex-dependent penalties. the quality of a solution is then measured by adding the leng... 详细信息
来源: 评论
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup theory and Equivariant Decomposition theorem  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Hildebrand, Robert Koppe, Matthias Zhou, Yuan Virginia Tech Grado Dept Ind & Syst Engn Blacksburg VA USA Univ Calif Davis Dept Math Davis CA 95616 USA Univ Kentucky Dept Math Lexington KY 40506 USA
the non-extreme minimal valid functions for the Gomory-Johnson infinite group problem are those that admit effective perturbations. For a class of piecewise linear functions for the 1-row problem we give a precise des... 详细信息
来源: 评论
Optimizing Low Dimensional Functions over the integers  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Dadush, Daniel Leonard, Arthur Rohwedder, Lars Verschae, Jose CWI Amsterdam Netherlands ENS Paris France Maastricht Univ Maastricht Netherlands Pontificia Univ Catolica Chile Santiago Chile
We consider box-constrained integer programs with objective g(Wx)+ c(inverted perpendicular) x, where g is a "complicated" function with an m dimensional domain. Here we assume we have n >> m variables... 详细信息
来源: 评论
Online combinatorial Assignment in Independence Systems  25th
Online Combinatorial Assignment in Independence Systems
收藏 引用
25th international conference on integer programming and combinatorial optimization (ipco)
作者: Marinkovic, Javier Soto, Jose A. Verdugo, Victor Univ Chile Dept Math Engn Santiago Chile Univ Chile Ctr Math Modeling IRL CNRS 2807 Santiago Chile Pontificia Univ Catalica Chile Inst Math & Computat Engn Santiago Chile Pontificia Univ Catalica Chile Dept Ind & Syst Engn Santiago Chile
We consider an online multi-weighted generalization of several classic online optimization problems called the online combinatorial assignment problem. We are given an independence system over a ground set of elements... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Fixed-Charge Transportation on a Path: Linear programming Formulations
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Van Vyve, Mathieu Ctr Operat Res & Econometr Voie Roman Pays 34 B-1348 Louvain La Neuve Belgium Louvain Sch Management Voie Roman Pays 34 B-1348 Louvain La Neuve Belgium
the fixed-charge transportation problem is a fixed-charge network flow problem on a bipartite graph. this problem appears as a subproblem in many hard transportation problems, and has also strong links with the challe... 详细信息
来源: 评论