咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 1 篇 理学
    • 1 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 2 篇 second-order con...
  • 2 篇 integer hull of ...
  • 2 篇 integer conic pr...
  • 2 篇 subadditive func...
  • 2 篇 cut generating f...
  • 1 篇 pooling problem
  • 1 篇 quadratically co...
  • 1 篇 bilinear program...
  • 1 篇 convex hull
  • 1 篇 branching rule
  • 1 篇 rank-1 constrain...

机构

  • 1 篇 georgia institut...
  • 1 篇 georgia inst tec...

作者

  • 2 篇 santana asteroid...
  • 1 篇 dey santanu s.

语言

  • 2 篇 英文
检索条件"主题词=Integer conic programming"
2 条 记 录,以下是1-10 订阅
排序:
Some cut-generating functions for second-order conic sets
收藏 引用
DISCRETE OPTIMIZATION 2017年 24卷 51-65页
作者: Santana, Asteroide Dey, Santanu S. Georgia Inst Technol ISyE 765 Ferst Dr NW Atlanta GA 30332 USA
In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give th... 详细信息
来源: 评论
Strong convex relaxations for quadratically constrained quadratic programs
Strong convex relaxations for quadratically constrained quad...
收藏 引用
作者: Santana, Asteroide Georgia Institute of Technology
学位级别:博士
Many classes of mixed integer nonlinear programs (MINLPs) are challenging to solve. A common approach to solve a MINLP is to use a combination of a branch-and-bound algorithm together with convexification and/or cutti... 详细信息
来源: 评论