咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
the Structure of the Infinite Models in integer programming  1
收藏 引用
19th international conference on integer programming and combinatorial optimization (IPCO)
作者: Basu, Amitabh Conforti, Michele Di Summa, Marco Paat, Joseph Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD USA Univ Padua Dipartimento Matemat Padua Italy
the infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these t... 详细信息
来源: 评论
A Polyhedral Study of the Mixed integer Cut
A Polyhedral Study of the Mixed Integer Cut
收藏 引用
14th international conference integer programming and combinatorial optimization
作者: Tyber, Steve Johnson, Ellis L. Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA
General purpose cutting planes have played a central role in modern IP solvers. In practice, the Gomory mixed integer cut has proven to be among the most useful general purpose cuts. One may obtain this inequality fro... 详细信息
来源: 评论
AN ANALYSIS OF OPTIMIZED CAPEX FOR MULTI-CORE FIBER BASED OPTICAL NETWORKS  13
AN ANALYSIS OF OPTIMIZED CAPEX FOR MULTI-CORE FIBER BASED OP...
收藏 引用
13th international conference on Optical Communications and Networks (IEEE ICOCN)
作者: Li, Yao Hua, Nan Zheng, Xiaoping Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Dept Elect Engn Beijing 100084 Peoples R China
In this article, we investigate the costs of optical network Capital Expenditure (CapEx) components which include fiber, optical amplifier (OA), cable and conduit. the CapEx of high-capacity optical network under give... 详细信息
来源: 评论
Branched Polyhedral Systems
Branched Polyhedral Systems
收藏 引用
14th international conference integer programming and combinatorial optimization
作者: Kaibel, Volker Loos, Andreas Otto von Guericke Univ Inst Math Optimierung D-39108 Magdeburg Germany
We introduce the framework of branched polyhedral systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other polyhedra. the framework, for instance,... 详细信息
来源: 评论
Solving integer and disjunctive programs by lift and project  6th
Solving integer and disjunctive programs by lift and project
收藏 引用
6th international conference on integer programming and combinatorial optimization (IPCO VI)
作者: Ceria, S Pataki, G Columbia Univ Grad Sch Business New York NY 10027 USA Columbia Univ Comp Optimizat Res Ctr New York NY 10027 USA Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA
We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive constraints, and also present a new, substantially improved disjunctive cut generator. ... 详细信息
来源: 评论
Matching problems in polymatroids without double circuits
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Makai, Marton Pap, Gyula Szabo, Jacint MTA-ELTE Egerváry Research Group on Combinatorial Optimization
Accordirig to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double... 详细信息
来源: 评论
the smoothed number of Pareto optimal solutions in bicriteria integer optimization
收藏 引用
12th international integer programming and combinatorial optimization conference
作者: Beier, Rene Roeglin, Heiko Voecking, Berthold Max Planck Inst Informat Saarbrucken Germany Rhein Westfal TH Aachen Dept Comp Sci D-52056 Aachen Germany
A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. the heuristics... 详细信息
来源: 评论
An integer programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
An Integer Programming and Decomposition Approach to General...
收藏 引用
14th international conference integer programming and combinatorial optimization
作者: Luedtke, James Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA
We present a new approach for exactly solving general chance constrained mathematical programs having discrete distributions. Such problems have been notoriously difficult to solve due to nonconvexity of the feasible ... 详细信息
来源: 评论
A Simulation-Based Benders' Cuts Generation for the Joint Workstation, Workload and Buffer Allocation Problem  13
A Simulation-Based Benders' Cuts Generation for the Joint Wo...
收藏 引用
13th IEEE conference on Automation Science and Engineering (IEEE CASE)
作者: Zhang, Mengyi Matta, Andrea Alfieri, Arianna Pedrielli, Giulia Politecn Milan Dept Mech Engn I-20151 Milan Italy Politecn Torino Dept Engn Management I-10129 Turin Italy Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA
the Discrete Event optimization (DEO) framework was recently proposed to formulate the simulation-optimization model of the Joint Workstation, Workload and Buffer Allocation Problem (JWWBAP) of the open flow line. How... 详细信息
来源: 评论
Linearizing Quadratic Assignment Problem  20
Linearizing Quadratic Assignment Problem
收藏 引用
20th international conference/Euro Mini conference on Continuous optimization and Knowledge-Based Technologies (EurOPT 2008)
作者: Singh, Surya Prakash Xavier Inst Management Bhubaneswar 751013 Khurda India
In past several linearization of the Quadratic Assignment Problem (QAP) which is a NP-hard problem have been given (See Lawler (1962) and Christofides et al. (1980)). Here, a new set of constraints that perfectly line... 详细信息
来源: 评论