咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
Latency-Constrained Task Distribution in Multi-Access Edge Computing Systems  11
Latency-Constrained Task Distribution in Multi-Access Edge C...
收藏 引用
11th IEEE international conference on Cloud Networking (CloudNet)
作者: Ricardo, Guilherme Iecker Benhamiche, Amal Perrot, Nancy Carlinet, Yannick Orange Labs Chatillon France
Multi-Access Edge Computing (MEC) paradigm has been widely studied as a potential solution to cope with the challenges emerging from new generations of mobile networks. By processing applications' data closer to t... 详细信息
来源: 评论
A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles  29
A New Approach to Finding 2 x n Partially Spatially Balanced...
收藏 引用
29th international conference on Principles and Practice of Constraint programming, CP 2023
作者: Mirka, Renee Greenstreet, Laura Grimson, Marc Gomes, Carla P. Cornell University IthacaNY United States
Partially spatially balanced Latin rectangles are combinatorial structures that are important for experimental design. However, it is computationally challenging to find even small optimally balanced rectangles, where... 详细信息
来源: 评论
Beyond Optimal Solutions for Real-World Problems  29
Beyond Optimal Solutions for Real-World Problems
收藏 引用
29th international conference on Principles and Practice of Constraint programming, CP 2023
作者: de la Banda, Maria Garcia Department of Data Science and AI Faculty of IT Monash University ClaytonVIC Australia ARC Industrial Training and Transformation Centre OPTIMA CarltonVIC Australia
combinatorial optimisation technology has come a long way. We now have mature high-level modelling languages in which to specify a model of the particular problem of interest [18, 7, 24, 6];robust complete solvers in ... 详细信息
来源: 评论
Persistency of Linear programming Relaxations for the Stable Set Problem  21st
Persistency of Linear Programming Relaxations for the Stable...
收藏 引用
21st international conference on integer programming and combinatorial optimization (ipco)
作者: Rodriguez-Heck, Elisabeth Stickler, Karl Walter, Matthias Weltge, Stefan Rhein Westfal TH Aachen Lehrstuhl Operat Res Aachen Germany Univ Twente Dept Appl Math Enschede Netherlands Tech Univ Munich Dept Math Munich Germany
the Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that ass... 详细信息
来源: 评论
18th international conference on integer programming and combinatorial optimization, ipco 2016
18th International Conference on Integer Programming and Com...
收藏 引用
18th international conference on integer programming and combinatorial optimization, ipco 2016
the proceedings contain 33 papers. the special focus in this conference is on integer programming and combinatorial optimization. the topics include: On approximation algorithms for concave mixed-integer quadratic pro...
来源: 评论
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 ... 详细信息
来源: 评论
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time  20th
Computing the Nucleolus of Weighted Cooperative Matching Gam...
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Konemann, Jochen Pashkovich, Kanstantsin Toth, Justin Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Ottawa Ottawa ON K1N 6N5 Canada
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathemat... 详细信息
来源: 评论
An Approximate Solution of a GNSS Satellite Selection Problem Using Semidefinite programming  1
收藏 引用
10th international conference on optimization and Applications (OPTIMA)
作者: Rapoport, Lev Tormagov, Timofey Russian Acad Sci VA Trapeznikov Inst Control Sci Moscow Russia Moscow Inst Phys & Technol Dolgoprudnyi Moscow Region Russia
When processing multiple navigation satellite systems, including GPS, GLONASS, Galileo, Beidou, QZSS, the overall number of the pseudorange and carrier phase signals can exceed several tens. On the other hand, a much ... 详细信息
来源: 评论
Identically Self-blocking Clutters  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Abdi, Ahmad Cornuejols, Gerard Lee, Dabeen Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from {{a}} is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Pr... 详细信息
来源: 评论
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry  1
收藏 引用
20th international conference on integer programming and combinatorial optimization (ipco)
作者: Bendotti, Pascale Fouilhoux, Pierre Rottner, Cecile Sorbonne Univ CNRS 7606 LIP6 Paris France EDF R&D Palaiseau France
We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. We propose a framework to build (sub-)symmetry-breaking inequalitie... 详细信息
来源: 评论