咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
integer programs with prescribed number of solutions and a weighted version of Doignon-bell-scarf's theorem
收藏 引用
17th international conference on integer programming and combinatorial optimization, ipco 2014
作者: Aliev, Iskander De Loera, Jesús A. Louveaux, Quentin Cardiff University United Kingdom University of California Davis United States Université de Liège Belgium
In this paper we study a generalization of the classical feasibility problem in integer linear programming, where an ILP needs to have a prescribed number of solutions to be considered solved. We first provide a gener... 详细信息
来源: 评论
Adaptive embedded systems: New composed technical solutions for feasible low-power and real-time flexible OS tasks
Adaptive embedded systems: New composed technical solutions ...
收藏 引用
international conference on Informatics in Control, Automation and Robotics (ICINCO)
作者: Hamza Chniter Mohamed Khalgui Fethi Jarray INSAT Institute University of Carthage Carthage Tunisia ISI Institute Mednine Tunisia FST faculty University of Elmanar Elmanar Tunisia Laboratoire CEDRIC CNAM France
the paper deals with low-power adaptive scheduling of synchronous and flexible real-time OS tasks. A software reconfiguration scenario is assumed to be any run-time operation allowing the addition-removal-update of OS... 详细信息
来源: 评论
Cut-generating functions
收藏 引用
16th conference on integer programming and combinatorial optimization, ipco 2013
作者: Conforti, Michele Cornuéjols, Gérard Daniilidis, Aris Lemaréchal, Claude Malick, Jérôme University of Padova Italy Carnegie Mellon University United States Autonomous University of Barcelona Spain INRIA Grenoble France CNRS Grenoble France
In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ +n : Rx ∈ S} where R is a general real matrix and S ⊂ q is a specific closed set with 0 ∉ S. F... 详细信息
来源: 评论
A tight MILP formulation based on multi-product valid inequalities for a lot-sizing problem
A tight MILP formulation based on multi-product valid inequa...
收藏 引用
5th international conference on Industrial Engineering and Systems Management (IEEE IESM)
作者: Gicquel, Celine Minoux, Michel Univ Paris 11 Lab Rech Informat F-91405 Orsay France Univ Paris 06 Lab Informat Paris 6 F-75005 Paris France
We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developping an ex... 详细信息
来源: 评论
integer programming and combinatorial optimization - 14th international conference, ipco 2010, Proceedings
Integer Programming and Combinatorial Optimization - 14th In...
收藏 引用
14th international conference on integer programming and combinatorial optimization, ipco 2010
the proceedings contain 34 papers. the topics discussed include: solving LP relaxations of large-scale precedence constrained problems;computing minimum multiway cuts in hypergraphs from hypertree packings;eigenvalue ...
来源: 评论
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via combinatorial Relaxation
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Iwata, Satoru Takamatsu, Mizuyo Kyoto Univ Math Sci Res Inst Kyoto 6068502 Japan Chuo Univ Dept Informat & Syst Engn Tokyo 1128551 Japan
Mixed polynomial matrices are polynomial matrices with two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. the comp... 详细信息
来源: 评论
Jump Number of Two-Directional Orthogonal Ray Graphs
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Soto, Jose A. Telha, Claudio MIT Dept Math Cambridge MA 02139 USA MIT Ctr Operat Res Cambridge MA USA
We model maximum cross-free matchings and minimum biclique covers of two-directional orthogonal ray graphs (2-dorgs) as maximum independent sets and minimum hitting sets of an associated family of rectangles in the pl... 详细信息
来源: 评论
An Exact Rational Mixed-integer programming Solver
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Cook, William Koch, thorsten Steffy, Daniel E. Wolter, Kati Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Zuse Inst Berlin Berlin Germany
We present an exact rational solver for mixed-integer linear programming that avoids the numerical inaccuracies inherent in the floating-point computations used by existing software. this allows the solver to be used ... 详细信息
来源: 评论
integer programming and Combinatoral optimization - 15th international conference, ipco 2011, Proceedings
收藏 引用
15th international conference on integer programming and combinatorial optimization, ipco 2011
the proceedings contain 33 papers. the topics discussed include: an excluded minor characterization of seymour graphs;complexity analyses of bienstock-zuckerberg and lasserre relaxations on the matching and stable set...
来源: 评论
A New Approach to the Stable Set Problem Based on Ellipsoids
收藏 引用
15th international conference on integer programming and combinatorial optimization (ipco)
作者: Giandomenico, Monia Letchford, Adam N. Rossi, Fabrizio Smriglio, Stefano Univ Aquila Dept Comp Sci Laquila Italy Univ Lancaster Dept Management Sci Lancaster England
A new exact approach to the stable set problem is presented, which attempts to avoids the pitfalls of existing approaches based on linear and semidefinite programming. the method begins by constructing an ellipsoid th... 详细信息
来源: 评论