咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 537 篇 工学
    • 458 篇 计算机科学与技术...
    • 122 篇 软件工程
    • 84 篇 电气工程
    • 44 篇 信息与通信工程
    • 39 篇 控制科学与工程
    • 13 篇 机械工程
    • 9 篇 生物工程
    • 8 篇 电子科学与技术(可...
    • 8 篇 化学工程与技术
    • 8 篇 交通运输工程
    • 6 篇 环境科学与工程(可...
    • 5 篇 仪器科学与技术
    • 5 篇 冶金工程
    • 5 篇 安全科学与工程
    • 4 篇 光学工程
    • 4 篇 动力工程及工程热...
    • 4 篇 水利工程
    • 4 篇 石油与天然气工程
  • 339 篇 理学
    • 320 篇 数学
    • 43 篇 系统科学
    • 14 篇 生物学
    • 12 篇 物理学
    • 11 篇 统计学(可授理学、...
    • 4 篇 化学
  • 164 篇 管理学
    • 157 篇 管理科学与工程(可...
    • 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 条 记 录,以下是91-100 订阅
排序:
On the exact separation of mixed integer knapsack cuts
On the exact separation of mixed integer knapsack cuts
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Fukasawa, Ricardo Goycoolea, Marcos Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Adolfo Ibanez Schl Business Santiago Chile
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has had as much practical success as the MI... 详细信息
来源: 评论
Sign-solvable linear complementarity problems
Sign-solvable linear complementarity problems
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Kakimura, Naonori Univ Tokyo Grad Sch Informat Sci & Technol Dept Math Informat Tokyo 1138656 Japan
this paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined... 详细信息
来源: 评论
Solving LP Relaxations of Large-Scale Precedence Constrained Problems
Solving LP Relaxations of Large-Scale Precedence Constrained...
收藏 引用
14th international conference integer programming and combinatorial optimization
作者: Bienstock, Daniel Zuckerberg, Mark Columbia Univ APAM Dept IEOR Dept New York NY 10027 USA BHP Billiton Ltd Resource & Business Optimizat Grp Funct Delhi India
We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that;can be em... 详细信息
来源: 评论
the induced disjoint paths problem
收藏 引用
13th international conference on integer programming and combinatorial optimization
作者: Kawarabayashi, Ken-ichi Kobayashi, Yusuke Natl Inst Informat Tokyo 1018430 Japan Univ Tokyo Tokyo 1138656 Japan
For a graph G and a collection of vertex pairs {(s(1), t(1)),..., (s(k), t(k))}, the disjoint paths problem is to find k vertex-disjoint paths P-1,..., P-k, where P-i is a path from s(i) to t(i) for each i = 1,..., k.... 详细信息
来源: 评论
On a generalization of the Master Cyclic Group Polyhedron
On a generalization of the Master Cyclic Group Polyhedron
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Dash, Sanjeeb Fukasawa, Ricardo Gunluk, Oktay IBM Corp Thomas J Watson Res Ctr Dept Math Sci Yorktown Hts NY 10598 USA
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of the nontrivial facet-defining inequalit... 详细信息
来源: 评论
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.... 详细信息
来源: 评论
the performance of the modified subgradient algorithm on solving the 0-1 quadratic knapsack problem  20
The performance of the modified subgradient algorithm on sol...
收藏 引用
20th international conference/Euro Mini conference on Continuous optimization and Knowledge-Based Technologies (EurOPT 2008)
作者: Sipahioglu, Aydin Sarac, Tugba Osmangazi Univ Dept Ind Engn TR-26030 Bademlik Eskisehir Turkey
In this study, the performance of the modified subgradient algorithm (MSG) to solve the 0-1 quadratic knapsack problem (QKP) is examined. the MSG is proposed by Gasimov for solving dual problems constructed with respe... 详细信息
来源: 评论
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... 详细信息
来源: 评论
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms  7th
收藏 引用
7th international conference on integer programming and combinatorial optimization (IPCO VII)
作者: Klein, P Young, N Brown Univ Providence RI 02912 USA Dartmouth Coll Hanover NH 03755 USA
We start with definitions given by Plotkin, Shmoys, and Tardos [16]. Given A∈?m×n, b∈?m and a polytope P $
 \subseteq$
 \subseteq ? n , the fractional packing problem is to find an x ∈ P such t...
来源: 评论
the linear programming polytope of binary constraint problems with bounded tree-width
收藏 引用
4th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems
作者: Sellmann, Meinolf Mercier, Luc Leventhal, Daniel H. Brown Univ Dept Comp Sci 115 Waterman StPOB 1910 Providence RI 02912 USA
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure results in a polynomial-size linear prog... 详细信息
来源: 评论