咨询与建议

限定检索结果

文献类型

  • 219 篇 会议
  • 7 篇 期刊文献
  • 5 册 图书

馆藏范围

  • 229 篇 电子文献
  • 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 篇 graph theory
  • 5 篇 cutting planes
  • 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...
  • 2 篇 maximum coverage...
  • 2 篇 polynomial appro...
  • 2 篇 energy consumpti...

机构

  • 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...

语言

  • 228 篇 英文
  • 3 篇 中文
检索条件"任意字段=11th International IPCO Conference on Integer Programming and Combinatorial Optimization"
231 条 记 录,以下是31-40 订阅
排序:
Designing optimization Problems with Diverse Solutions  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Hanguir, Oussama Ma, Will Ryan, Christopher thomas Columbia Univ Ind Engn & Operat Res New York NY 10027 USA Columbia Univ Grad Sch Business New York NY 10027 USA Univ British Columbia UBC Sauder Sch Business Vancouver BC V6T 1Z2 Canada
We consider the problem of designing a linear program that has diverse solutions as the right-hand side varies. this problem arises in video game settings where designers aim to have players use different "weapon... 详细信息
来源: 评论
From Approximate to Exact integer programming  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Dadush, Daniel Eisenbrand, Friedrich Rothvoss, thomas CWI Amsterdam Netherlands Ecole Polytech Fed Lausanne Lausanne Switzerland Univ Washington Seattle WA 98195 USA
Approximate integer programming is the following: For a given convex body K subset of R-n, either determine whether K boolean AND Z(n) is empty, or find an integer point in the convex body 2 center dot (K - c) + c whi... 详细信息
来源: 评论
Optimizing Low Dimensional Functions over the integers  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Dadush, Daniel Leonard, Arthur Rohwedder, Lars Verschae, Jose CWI Amsterdam Netherlands ENS Paris France Maastricht Univ Maastricht Netherlands Pontificia Univ Catolica Chile Santiago Chile
We consider box-constrained integer programs with objective g(Wx)+ c(inverted perpendicular) x, where g is a "complicated" function with an m dimensional domain. Here we assume we have n >> m variables... 详细信息
来源: 评论
LEARNING TO GENERATE COLUMNS WIth APPLICATION TO VERTEX COLORING  11
LEARNING TO GENERATE COLUMNS WITH APPLICATION TO VERTEX COLO...
收藏 引用
11th international conference on Learning Representations, ICLR 2023
作者: Sun, Yuan Ernst, Andreas T. Li, Xiaodong Weiner, Jake La Trobe University Australia Monash University Australia RMIT University Australia
We present a new column generation approach based on Machine Learning (ML) for solving combinatorial optimization *** aim of our method is to generate high-quality columns that belong to an optimal integer solution, i... 详细信息
来源: 评论
Inapproximability of Shortest Paths on Perfect Matching Polytopes  1
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Cardinal, Jean Steiner, Raphael Univ Libre Bruxelles ULB Brussels Belgium Swiss Fed Inst Technol Zurich Switzerland
We consider the computational problem of finding short paths in the skeleton of the perfect matching polytope of a bipartite graph. We prove that unless P = NP, there is no polynomial-time algorithm that computes a pa... 详细信息
来源: 评论
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid  24th
Constant-Competitiveness for Random Assignment Matroid Secre...
收藏 引用
24th international conference on integer programming and combinatorial optimization (ipco)
作者: Santiago, Richard Sergeev, Ivan Zenklusen, Rico Swiss Fed Inst Technol Dept Mathemat Zurich Switzerland
the Matroid Secretary Conjecture is a notorious open problem in online optimization. It claims the existence of an O(1)-competitive algorithm for the Matroid Secretary Problem (MSP). Here, the elements of a weighted m... 详细信息
来源: 评论
19th international conference on integer programming and combinatorial optimization, ipco 2017
19th International Conference on Integer Programming and Com...
收藏 引用
19th international conference on integer programming and combinatorial optimization, ipco 2017
the proceedings contain 36 papers. the special focus in this conference is on integer programming and combinatorial optimization. the topics include: On scheduling coflows;integrality gaps of integer knapsack problems...
来源: 评论
A GNN-GUIDED PREDICT-AND-SEARCH FRAMEWORK FOR MIXED-integer LINEAR programming  11
A GNN-GUIDED PREDICT-AND-SEARCH FRAMEWORK FOR MIXED-INTEGER ...
收藏 引用
11th international conference on Learning Representations, ICLR 2023
作者: Han, Qingyu Yang, Linxin Chen, Qian Zhou, Xiang Zhang, Dong Wang, Akang Sun, Ruoyu Luo, Xiaodong Shenzhen Research Institute of Big Data China Shandong University China School of Data Science The Chinese University of Hong Kong Shenzhen China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Huawei China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data China
Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learn... 详细信息
来源: 评论
Monoidal Strengthening of Simple V -Polyhedral Disjunctive Cuts  24th
Monoidal Strengthening of Simple V -Polyhedral Disjunctive ...
收藏 引用
24th international conference on integer programming and combinatorial optimization, ipco 2023
作者: Kazachkov, Aleksandr M. Balas, Egon University of Florida GainesvilleFL United States Carnegie Mellon University PittsburghPA United States
Disjunctive cutting planes can tighten a relaxation of a mixed-integer linear program. Traditionally, such cuts are obtained by solving a higher-dimensional linear program, whose additional variables cause the procedu... 详细信息
来源: 评论
A PTAS for the Horizontal Rectangle Stabbing Problem  23rd
A PTAS for the Horizontal Rectangle Stabbing Problem
收藏 引用
23rd international conference on integer programming and combinatorial optimization (ipco)
作者: Khan, Arindam Subramanian, Aditya Wiese, Andreas Indian Inst Sci Bengaluru India Vrije Univ Amsterdam Amsterdam Netherlands
We study rectangle stabbing problems in which we are given n axis-aligned rectangles in the plane that we want to stab, i.e., we want to select line segments such that for each given rectangle there is a line segment ... 详细信息
来源: 评论