咨询与建议

限定检索结果

文献类型

  • 703 篇 会议
  • 21 篇 期刊文献
  • 17 册 图书

馆藏范围

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

日期分布

学科分类号

  • 537 篇 工学
    • 458 篇 计算机科学与技术...
    • 122 篇 软件工程
    • 84 篇 电气工程
    • 44 篇 信息与通信工程
    • 39 篇 控制科学与工程
    • 13 篇 机械工程
    • 9 篇 生物工程
    • 8 篇 电子科学与技术(可...
    • 8 篇 化学工程与技术
    • 8 篇 交通运输工程
    • 6 篇 环境科学与工程(可...
    • 5 篇 仪器科学与技术
    • 5 篇 冶金工程
    • 5 篇 安全科学与工程
    • 4 篇 光学工程
    • 4 篇 动力工程及工程热...
    • 4 篇 水利工程
    • 4 篇 石油与天然气工程
  • 340 篇 理学
    • 321 篇 数学
    • 43 篇 系统科学
    • 14 篇 生物学
    • 12 篇 物理学
    • 11 篇 统计学(可授理学、...
    • 4 篇 化学
  • 165 篇 管理学
    • 158 篇 管理科学与工程(可...
    • 44 篇 工商管理
  • 18 篇 经济学
    • 16 篇 应用经济学
  • 6 篇 医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 临床医学
  • 4 篇 法学
    • 4 篇 社会学
  • 2 篇 教育学
  • 2 篇 文学
  • 2 篇 农学

主题

  • 195 篇 integer programm...
  • 87 篇 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

语言

  • 732 篇 英文
  • 5 篇 其他
  • 4 篇 中文
检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"
741 条 记 录,以下是191-200 订阅
排序:
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... 详细信息
来源: 评论
An In-Out Approach to Disjunctive optimization
An In-Out Approach to Disjunctive Optimization
收藏 引用
7th international conference Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Fischetti, Matteo Salvagnin, Domenico Univ Padua DEI I-35100 Padua Italy Univ Padua dmpa Padua Italy
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-integer Programs (MIPs). this is obtained by embedding a cut-se... 详细信息
来源: 评论
On the Design of the Next Generation Access Networks
On the Design of the Next Generation Access Networks
收藏 引用
7th international conference Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Gualandi, Stefano Malucelli, Federico Sozzi, Domenico L. Politecn Milan Dipartimento Elettron & Informaz Milan Italy
We present a class of problems that arise in the design of the Next Generation Access Networks. the main features of these networks are: to be based on fiber links of relatively long length with respect to traditional... 详细信息
来源: 评论
An Improved Deterministic Rescaling for Linear programming Algorithms  19th
An Improved Deterministic Rescaling for Linear Programming A...
收藏 引用
19th international conference on integer programming and combinatorial optimization (IPCO)
作者: Hoberg, Rebecca Rothvoss, thomas Univ Washington Seattle WA 98105 USA
the perceptron algorithm for linear programming, arising from machine learning, has been around since the 1950s. While not a polynomial-time algorithm, it is useful in practice due to its simplicity and robustness. In... 详细信息
来源: 评论
A Bundle Approach for SDPs with Exact Subgraph Constraints  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (IPCO)
作者: Gaar, Elisabeth Rendl, Franz Alpen Adria Univ Klagenfurt Inst Math Univ Str 65-67 A-9020 Klagenfurt Austria
the 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relax... 详细信息
来源: 评论
On the Number of Degenerate Simplex Pivots  25th
On the Number of Degenerate Simplex Pivots
收藏 引用
25th international conference on integer programming and combinatorial optimization (IPCO)
作者: Kukharenko, Kirill Sanita, Laura Otto von Guericke Univ Magdeburg Germany Bocconi Univ Milan Italy
the simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to ... 详细信息
来源: 评论
combinatorial benders' cuts
收藏 引用
10th international integer programming and combinatorial optimization conference
作者: Codato, G Fischetti, M Univ Padua Dept Informat Engn DEI I-35100 Padua Italy
Mixed-integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and analyze computationally an automatic prob... 详细信息
来源: 评论
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
来源: 评论
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... 详细信息
来源: 评论
Semi-continuous cuts for mixed-integer programming
收藏 引用
10th international integer programming and combinatorial optimization conference
作者: de Farias, IR SUNY Buffalo Dept Ind Engn Buffalo NY 14260 USA
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack... 详细信息
来源: 评论